#include #include #include #include #include #include #include #include #include #include #include #include #include #include typedef long long ll; using namespace std; #define debug(x) cerr << #x << " = " << (x) << endl; #define mod 1000000007 //1e9+7(prime number) #define INF 1000000000 //1e9 #define LLINF 2000000000000000000LL //2e18 #define SIZE 100010 int main(){ ll n,n2; cin >> n; n2 = n; ll t = 2; if(n == 0){ puts("X"); return 0; } if((n/2 + n)%2){ puts("O"); return 0; } n2/=2; for(int i=1;n2;i++){ int p = n%t; if((p + n2)%2==1){ puts("O"); return 0; } n2/=2; t*=2; } puts("X"); return 0; } /* XOR -> 0 ... X 111 110 101 100 011 010 001 000 */