这里套的是高精度版子，代码如下：

#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define W while
#define I inline
#define RI register int
#define LL long long
#define Cn const
#define gc getchar
#define DD isdigit(c=gc())
#define pc(c) putchar((c))
#define min(x,y) ((x)<(y)?(x):(y))
#define max(x,y) ((x)>(y)?(x):(y))
#define DEBUG printf("Passing [%s] in LINE %d...\n",__FUNCTION__,__LINE__)
using namespace std;
I long long quick_pow(long long a,int b,int mod){long long A=a,s=1;W(b!=0){if(b%2==1) s=s*A%mod;A=A*A%mod;b>>=1;}return s;}//快速幂
class Int{//Manchery的高精模板（修改） 
	#define BASE 1000000000
	public:
	typedef long long value;
	I void New(size_t l){
	}
	Int():base(BASE){}
	Int(value x):base(BASE){*this=x;}
	Int(value x,value _base):base(_base){*this=x;}
	Int(const Int &B):base(BASE){*this=B;}
	~Int(){}
	I Int& operator =(value x){
		size_t l=1;for (value x1=max(x,-x);x1>=base;++l,x1/=base);New(l);
		if (x<0)x=-x,sign=0;else sign=1;
		len=0;while (x)a[len++]=x%base,x/=base;
		if (!len)a[len++]=0;
		return *this;
	}
	I Int& operator =(const Int &A){
		New(A.len);len=A.len;memcpy(a,A.a,sizeof(value)*len);
		base=A.base;sign=A.sign;return *this;
	}
	I friend Int operator -(Int A){A.sign=1-A.sign;return A;}
	I bool operator !(){if (len==1&&a[0]==0)return 1;else return 0;}
	I friend Int operator +(Int A,Int B){
		if (A.sign!=B.sign){B.sign=1-B.sign;return A-B;}
		if (A.base!=B.base)
			if (A.base>B.base)B.set_base(A.base);
			else A.set_base(B.base);
		Int res;res.set_base(A.base); int len=A.len>B.len?A.len:B.len;
		res.New(len+1);res.sign=A.sign;
		memset(res.a,0,(len+1)*sizeof(value));
		for (int i=0;i<len;++i){
			if (i<A.len)res.a[i]+=A.a[i];
			if (i<B.len)res.a[i]+=B.a[i];
		}
		for (int i=0;i<len;++i)
			if (res.a[i]>=res.base)++res.a[i+1],res.a[i]-=res.base;
		if (res.a[len])res.len=len+1;else res.len=len;
		if (!res)res.sign=1;return res;
	}
	I friend Int operator -(Int A,Int B){
		if (A.sign!=B.sign){B.sign=1-B.sign;return A+B;}
		if (A.base!=B.base)
			if (A.base>B.base)B.set_base(A.base);
			else A.set_base(B.base);
		if (small(A,B))swap(A,B),A.sign=1-A.sign;
		Int res;res.set_base(A.base); int len=A.len>B.len?A.len:B.len;
		res.New(len);res.sign=A.sign;
		memset(res.a,0,len*sizeof(value));
		for (int i=0;i<len;++i){
			if (i>=B.len)res.a[i]+=A.a[i];
			else res.a[i]+=A.a[i]-B.a[i];
			if (res.a[i]<0)res.a[i]+=res.base,--res.a[i+1];
		}
		while (len>1&&!res.a[len-1])--len;res.len=len;
		if (!res)res.sign=1;return res;
	}
	I friend Int operator *(Int A,Int B){
		if (A.base!=B.base)
			if (A.base>B.base)B.set_base(A.base);
			else A.set_base(B.base);
		Int res;res.set_base(A.base); int len=A.len+B.len;
		res.New(len);res.sign=(A.sign==B.sign);
		memset(res.a,0,len*sizeof(value));
		for (int i=0;i<A.len;++i)
			for (int j=0;j<B.len;++j){
				res.a[i+j]+=A.a[i]*B.a[j];
				res.a[i+j+1]+=res.a[i+j]/res.base;
				res.a[i+j]%=res.base;
			}
		/*
		for (int i=0;i<A.len;++i)
			for (int j=0;j<B.len;++j)res.a[i+j]+=A.a[i]*B.a[j];
		for (int i=0;i<len-1;++i)res.a[i+1]+=res.a[i]/res.base,res.a[i]%=res.base;
		*/
		while (len>1&&!res.a[len-1])--len;res.len=len;
		return res;
	}
	I friend pair<Int,Int> divide(Int A,Int B){
		if (!B){puts("error:div zero!");for (;;);}
		if (A.base!=B.base)
			if (A.base>B.base)B.set_base(A.base);
			else A.set_base(B.base);
		if (small(A,B))return make_pair(Int(0),A);
		Int C,D;C.set_base(A.base);D.set_base(A.base);C.New(A.len);C.len=A.len;
		bool Csign=(A.sign==B.sign),Dsign=A.sign;A.sign=B.sign=1;
		for (int i=A.len-1;i>=0;--i){
			C.a[i]=0;D=D*D.base;D.a[0]=A.a[i];
			int l=0,r=A.base-1,mid;
			while (l<r){
				mid=(l+r+1)>>1;
				if (small(B*mid,D+1))l=mid;
					else r=mid-1;
			}
			C.a[i]=l;D=D-B*l;
		}
		C.sign=Csign;D.sign=Dsign;if (!D)D.sign=1;
		while (C.len>1&&!C.a[C.len-1])--C.len;
		return make_pair(C,D);
	}
	I Int operator /(value x){
		if (!x){puts("error:div zero!");for (;;);}
		value d=0;Int res;res.set_base(base);res.New(len);res.len=len;
		if (x<0)x=-x,res.sign=(sign==0);
		else res.sign=(sign==1);
		for (int i=len-1;i>=0;--i)
			d=d*base+a[i],res.a[i]=d/x,d%=x;
		while (res.len>1&&!res.a[res.len-1])--res.len;
		return res;
	}
	I Int operator %(value x){
		value d=0;if (x<0)x=-x;
		for (int i=len-1;i>=0;--i)d=(d*base+a[i])%x;
		return d;
	}
	I friend Int abs(Int A){A.sign=1;return A;}
	I friend bool small(Int A,Int B){
		if (A.base!=B.base)
			if (A.base>B.base)B.set_base(A.base);
			else A.set_base(B.base);
		if (A.len!=B.len)return A.len<B.len;
		for (int i=A.len-1;i>=0;--i)
			if (A.a[i]!=B.a[i])return A.a[i]<B.a[i];
		return 0;
	}
	I friend bool operator <(Int A,Int B){
		if (A.sign!=B.sign)return A.sign<B.sign;
		return A.sign==1?small(A,B):small(B,A);
	}
	I friend bool operator ==(Int A,Int B){
		if (A.base!=B.base)
			if (A.base>B.base)B.set_base(A.base);
			else A.set_base(B.base);
		if (A.sign!=B.sign||A.len!=B.len)return 0;
		for (int i=0;i<A.len;++i)if (A.a[i]!=B.a[i])return 0;
		return 1;
	}
	I friend bool operator !=(Int A,Int B){return !(A==B);}
	I friend bool operator >(Int A,Int B){return !(A<B||A==B);}
	I friend bool operator <=(Int A,Int B){return A<B||A==B;}
	I friend bool operator >=(Int A,Int B){return A>B||A==B;}
	I Int operator /(Int B){return divide(*this,B).first;}
	I Int operator %(Int B){return divide(*this,B).second;}
	I Int& operator +=(Int B){*this=*this+B;return *this;}
	I Int& operator -=(Int B){*this=*this-B;return *this;}
	I Int& operator *=(Int B){*this=*this*B;return *this;}
	I Int& operator /=(Int B){*this=*this/B;return *this;}
	I Int& operator %=(Int B){*this=*this%B;return *this;}
	I Int& operator ++(){*this=*this+1;return *this;}
	I Int& operator --(){*this=*this-1;return *this;}
	I Int operator ++(int){Int res(*this);*this=*this+1;return res;}
	I Int operator --(int){Int res(*this);*this=*this-1;return res;}
	I Int operator +(value x){return *this+Int(x,this->base);}
	I Int operator -(value x){return *this-Int(x,this->base);}
	I Int operator *(value x){return *this*Int(x,this->base);}
	//Int operator /(value x){Int T;T=x;return *this/T;}
	//Int operator %(value x){Int T;T=x;return *this%T;}
	I Int& operator *=(value x){*this=*this*x;return *this;}
	I Int& operator +=(value x){*this=*this+x;return *this;}
	I Int& operator -=(value x){*this=*this-x;return *this;}
	I Int& operator /=(value x){*this=*this/x;return *this;}
	I Int& operator %=(value x){*this=*this%x;return *this;}
	I bool operator ==(value x){return *this==Int(x,this->base);}
	I bool operator !=(value x){return *this!=Int(x,this->base);}
	I bool operator <=(value x){return *this<=Int(x,this->base);}
	I bool operator >=(value x){return *this>=Int(x,this->base);}
	I bool operator <(value x){return *this<Int(x,this->base);}
	I bool operator >(value x){return *this>Int(x,this->base);}
	I friend Int gcd(Int x,Int y){
		Int t;int cnt=0;
		while (1){
			if (x<y)t=x,x=y,y=t;
			if (y==0){
				while (cnt--)x*=2;
				return x;
			}
			if (x%2==0&&y%2==0)x/=2,y/=2,++cnt;
			else if (x%2==0)x/=2;
			else if (y%2==0)y/=2;
			else {t=x;x=y;y=t-y;}
		}
	}
	I void to_arr(char *c){
		char *c1=c;
		for (int i=0;i<len-1;++i)
			for (value x=a[i],b=base/10;b>=1;b/=10)*c1++='0'+x%10,x/=10;
		for (value x=a[len-1];x>0;x/=10)*c1++='0'+x%10;
		if (len==1&&a[len]==0)*c1++='0';
		if (sign==0)*c1++='-';*c1=0;reverse(c,c1);
	}
	I void from_arr(char *c){
		size_t base_l=get_basel(),b=1;int cl=strlen(c);value x=0;
		New((cl+base_l-1)/base_l);len=0;
		if (*c=='-')sign=0,++c,--cl;else sign=1;
		while (--cl>=0){
			x+=(c[cl]-'0')*b;b*=10;if (b==base)a[len++]=x,x=0,b=1;
		}
		if (!len||x)a[len++]=x;
		while (len>1&&!a[len-1])--len;
	}
	I void set_base(int _base){
		/*
		if (base==_base)return;
		char *c=new char[len*get_basel()+1];
		to_arr(c);base=_base;from_arr(c);
		delete[] c;
		*/
	}
	I void set_basel(int _l){
		size_t _base=1;while (_l--)_base*=10;set_base(_base);
	}
	I void read(){
		vector<char> s;char ch;
		scanf(" %c",&ch);if (ch=='-')s.push_back('-'),ch=getchar();
		for (;ch>='0'&&ch<='9';ch=getchar())s.push_back(ch);
		char *c=new char[s.size()+1];
		for (int i=0;i<s.size();++i)c[i]=s[i];c[s.size()]=0;
		from_arr(c);delete[] c;
		if (!*this)this->sign=1;
	}
	I void print(){
		if (!sign)putchar('-');
		printf("%d",int(a[len-1]));
		for (int i=len-2;i>=0;--i){
			for (int j=base/10;j>=10;j/=10)
				if (a[i]<j)putchar('0');
					else break;
			printf("%d",(int)a[i]);
		}
	}
	I void println(){print();putchar('\n');}
	I int length(){return len;}
	private:
	value a[2000],base;int len;bool sign;  //0="-"
	I size_t get_basel()const{
		size_t res=0;for (int b=base/10;b>=1;b/=10,++res);
		return res;
	}
	#undef BASE+
};
I Int fpow(Int a,long long b){Int A=a,s=1;W(b!=0){if(b%2==1) s*=A;A*=A;b=b/2;}return s;}//高精快速幂
I Int root(Int a,long long b)
{
	Int l=1,mid,result,ans;
	const int iter_base = 1000;
	Int r=iter_base;
	while(fpow(r,b)<a)
		r*=iter_base;
	l=r/iter_base;
	while(l<=r)
	{
		//DEBUG;
		mid = (l+r)/2;
		//mid.print();printf("\n");
		if(mid.length()*b-b+1<=a.length()&&fpow(mid,b)<=a)
		{
			ans=mid;
			l=mid+1;
		}
		else r=mid-1;
	}
	return ans;
}
Int a;
long long b;
int main(){
	scanf("%lld",&b);
	a.read();
	if(a==0)printf("0");
	else
		root(a,b).print();
}