For this Question: Aniket and Swapnil are playing a game in which they have two piles of stones with N1 and N2 stones respectively. They take turns picking any even positive number of stones from one of the pile and keep half of them on the other pile and throw away the other half. Whoever can not make a move loses. Given N1 and N2 find who will win. Swapnil makes the first move.The first and only line of input contains two integers N1 and N2.

Constraints 
1 <= N1, N2 <= 1000000000000000Print "Swapnil" if Swapnil wins the game and print "Aniket" if Aniket wins the game.Sample Input 1
2 1

Sample Output 1
Aniket

Sample Input  2
4 8

Sample Output 2
Swapnil, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc  __builtin_popcountll
#define m_p make_pair
#define inf 1e8+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
    return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
 
//////////////
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long  
#define f80 __float128
#define pii pair<int,int>
/////////////
 
signed main()
{
	fastio;
	#ifdef ANIKET_GOYAL
		freopen("inputf.in","r",stdin);
		freopen("outputf.in","w",stdout);
	#endif
	int x,y;
	cin>>x>>y;
	if(abs(x-y)<=1)
	{
		cout<<"Aniket";
	}
	else
		cout<<"Swapnil";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?