class Solution {
public String smallestGoodBase(String n) {
long num=Long.parseLong(n);
int dmax=(int)(Math.log(num)/Math.log(2))+1;
for(int i=dmax;i>=2;i--){
long kmin=2,kmax=(long)Math.pow(num,1.0/(i-1))+1;
while(kmin<kmax){
long kmid=(kmax-kmin)/2+kmin;
long tmp=0;
for(int j=0;j<i;j++){
tmp=tmp*kmid+1;
}
if(tmp==num)return Long.toString(kmid);
if(tmp<num)kmin=kmid+1;
else kmax=kmid-1;
}
}
return Long.toString(num-1); }
}