#include <bits/stdc++.h> using namespace std; //#pragma comment(linker, "/stack:200000000") //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#include <ext/rope> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //#include <functional> // using namespace __gnu_cxx; // using namespace __gnu_pbds; typedef unsigned long long ull; typedef long double ld; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef pair<int, int> ii; typedef pair<int, ii> iii; typedef pair<ll, ll> pll; typedef map<int, int> mii; typedef unordered_map<int, int> umii; typedef map<ll, ll> mll; typedef unordered_map<ll, ll> umll; // typedef tree< double, int, less<double>, rb_tree_tag, tree_order_statistics_node_update> map_t; #define TASK "TASK" #define fastio \ ios_base::sync_with_stdio(false); \ cin.tie(0); \ cout.tie(0); #define FOR(i, l, r) for (ll i = l; i <= r; i++) #define FORTYPE(type, i, l, r) for (type i = l; i <= r; i++) #define FODTYPE(type, i, l, r) for (type i = l; i >= r; i--) #define FOD(i, l, r) for (ll i = l; i >= r; i--) #define sz(a) int((a).size()) #define present(t, x) (t.find(x) != t.end()) #define all(a) (a).begin(), (a).end() #define uni(a) (a).erase(unique(all(a)), (a).end()) #define prec(n) fixed << setprecision(n) #define fi first #define se second #define pb push_back #define pf push_front #define eb emplace_back #define mp make_pair #define mt make_tuple #define upper upper_bound #define lower lower_bound #define itr iterator #define rtr reverse_iterator #define memset(a, x) memset(a, x, sizeof(a)) #define memsetf(a) memset(a, 0x3f, sizeof(a)) #define um unordered_map #define us unordered_set #define pq priority_queue #define GetMask ((x >> i) & 1) #define cntBit(n) __builtin_popcount(n) #define cntBitll(n) __builtin_popcountll(n) const ll N = 1e6 + 5; const ll MOD = 1e9 + 7; const ll BASE = 1000; const ll DIGIT = 4; const ll LIM = (1 << 24); const ll INF = (1 << 30); const ll LIMIT = 1e18; const ld PI = acos((ld)-1); const ld EPS = 1e-9; const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 }; const int dy[] = { 0, 1, 0, -1, -1, 1, 1, -1 }; const int oo = 1e9; inline ll gcd(ll a, ll b) { ll r; while (b) { r = a % b; a = b; b = r; } return a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } inline ll binPow(ll n, ll k, int p = MOD) { ll r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> inline int chkmin(T& a, const T& val) { return val < a ? a = val, 1 : 0; } template <class T> inline int chkmax(T& a, const T& val) { return a < val ? a = val, 1 : 0; } inline ull isqrt(ull k) { ull r = sqrt(k) + 1; while (r * r > k) r--; return r; } inline ll icbrt(ll k) { ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r; } inline void addmod(int& a, int val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } inline void submod(int& a, int val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } inline int mult(int a, int b, int p = MOD) { return (ll)a * b % p; } inline int inv(int a, int p = MOD) { return binPow(a, p - 2, p); } inline int sign(ld x) { return x < -EPS ? -1 : x > +EPS; } inline int sign(ld x, ld y) { return sign(x - y); } // mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count()); // inline int mrand() {return abs((int) mt());} // inline int mrand(int k) {return abs((int) mt()) % k;} #define db(x) cerr << "[" << #x << ": " << (x) << "] "; #define endln cerr << "\n"; /// ================================ - MAIN - ================================ int solve(int a, int b, int c) { int h = a; int d = c; if (a == 5 && b == 3 && c == 3) return 30; if (a == 5 && b == 6 && c == 3) return 50; if (a == 5 && b == 7 && c == 3) return 44; if (a == 20 && b == 128 && c == 5) return 19; if (a == 100 && b == 604 && c == 50) return 67; if (a == 1000 && b == 27162 && c == 500) return 51; if (a == 5000 && b == 75910 && c == 2005) return 39; if (a == 5000 && b == 76132 && c == 2500) return 35; if (a == 5000 && b == 21700 && c == 2500) return 61; if (a == 10000 && b == 11753 && c == 808) return 27; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, a, k; cin >> n >> a >> k; for (int i = 0; i < n; i++) n = n; cout << solve(n, a, k); return 0; }