#include //#include using namespace std; //using namespace atcoder; #define all(v) v.begin(),v.end() using ll = long long; using ull = unsigned long long; using lll = __int128; using vll=vector; using vvll = vector>; using P = pair; using vp=vector>; //using mint=modint1000000007; //using mint=modint998244353; const ll INF=1ll<<60; ll mod10=1e9+7; ll mod99=998244353; const double PI = acos(-1); #define rep(i,n) for (ll i=0;i=0;--i) #define rep2(i,a,n) for (ll i=a;i=n;--i) templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b>(istream &is, lll &x) { int c = is.peek(); while (c == ' ' || c == '\n') { is.get(); c = is.peek(); } bool neg = false; if (c == '-') { neg = true; is.get(); } x = 0; while (isdigit(is.peek())) x = x * 10 + is.get() - '0'; if (neg) x = -x; return is; } ostream &operator<<(ostream &os, lll x) { if (x < 0) { os << '-'; x = -x; } if (x == 0) return os << '0'; string s; while (x > 0) { s += x % 10 + '0'; x /= 10; } reverse(s.begin(), s.end()); return os << s; } bool solve(){ ll N;cin>>N; if(N==0){ cout << 0 <<" "<<0<< endl; return 0; }else if(N==1){ cout<<0<< " "<<0<>i&1) b=i; lll ans1=1ll<>i&1)) continue; lll v=0; rep(j,62){ if(j>j&1) v+=1ll<>T; rep(i,T) solve(); }