#include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define m0(x) memset(x,0,sizeof(x)) #define fill(x,y) memset(x,y,sizeof(x)) #define bg begin() #define ed end() #define all(x) x.bg,x.ed //#define mp make_pair #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> template void chmax(T &a, const T &b) {a = (a > b? a : b);} template void chmin(T &a, const T &b) {a = (a < b? a : b);} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; #define int long long int powmod(int n, int m, const int MOD) { int res = 1; while(m > 0) { if(m&1) res = (res*n)%MOD; n = (n*n)%MOD; m >>= 1; } return res; } // const ll mod1 = 998244353; // const ll mod2 = 1e9+7; // const ll mod = 998244353; // const ll mod = 1e9+7; const ll mod = 1e18; void solve() { int n; cin >> n; map cnt; repi(a, 20, 5001) { cnt[powmod(a*a-398, powmod(2, n, mod-1), mod)]++; } cout << mod << endl; vector uni; for(auto e : cnt) { bool flag = true; for(auto f : cnt) { if(e.first!=f.first&&e.second==f.second) flag = false; } if(flag) uni.push_back(e.first); } cout << uni.back() << endl; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }