#include <bits/stdc++.h>
using namespace std;
#define int long long
int binpow(int x,int n)
{
if(n==1)
return x;
if(n==0)
return 1;
int ans=binpow(x,n/2);
if(n%2)
return ans*ans*x;
return ans*ans;
}
int32_t main() {
int x,n;
cin>>x>>n;
int y=0;
while((x*(binpow(x,y)-1))/(x-1)<=n)
y++;
y--;
int t1=(binpow(x,y)-1)/(x-1);int t2=0;
if((n-t1*x)%x==0)
t2=(n-t1*x)/x;
else
t2=(n-t1*x)/x+1;
cout<<t1+t2<<endl;
}