#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; #define fi first #define se second #define mp make_pair #define rep(i, n) for(int i=0;i=0;--i) const int inf=1e9+7; const ll mod=1e9+7; const ll mod1=998244353; const ll big=1e18; const double PI=2*asin(1); ll mypow(ll a, ll b) { ll ans = 1; for(int i=0;i>A; ll l=1, r=100, m; bool can; ll ans; for(ll m=1;m<=100;++m) { can = false; for(ll i=1;i<=m;++i) { if(m%i!=0) continue; if(mypow(i, m/i)>=A) can = true; } if(can) { ans = m; break; } } cout<