For this Question: A circular array is called good if, for every index i (0 to N-1), there exists an index j such that i != j and sum of all the numbers in the clockwise direction from i to j is equal to the sum of all numbers in the anticlockwise direction from i to j.
You are given an circular array of size N, Your task is to check whether the given array is good or not.First line of input contains a single integer N, the next line of input contains N space separated integes depicting values of the array.

Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 1000000Print "Yes" if array is good else print "No"Sample Input:-
4
1 4 1 4

Sample Output:-
Yes

Explanation:-
for index 1, j will be 3, then sum of elements from index 1 to 3 in clockwise direction will be 1 + 4 + 1 = 6 and the sum of elements from index 1 to 3 in anticlockwise direction will be 1 + 4 + 1 = 6.
For index 2, j will be 4 
For index 3, j will be 1
For index 4, j will be 2

Sample Input:-
4
1 2 3 4

Sample Output:-
No, I have written this Solution Code: 
#include <bits/stdc++.h>


using namespace std;

#define MEM(a, b) memset(a, (b), sizeof(a))

#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)

#define IN(A, B, C) assert( B <= A && A <= C)

#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)

#define FOR1(i,j,a) for(int i=j;i<a;i++)

#define EB emplace_back


#define EPS 1e-9

#define PI 3.1415926535897932384626433832795
#define max1 10001
#define MOD 1000000007

#define read(type) readInt<type>()

#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int INF = 4557430888798830399ll;
signed  main()
{
     fast();
    int n;
    cin>>n;
    int a[n];
    FOR(i,n){
    cin>>a[i];}
    if(n&1){out("No");return 0;}
    FOR(i,n/2){
    if(a[i]!=a[n/2+i]){out("No");return 0;}
    }
    out("Yes");

}
, In this Programming Language: Unknown, Now tell me if this Code is compilable or not?