#include <stdio.h>
#include <stdlib.h>

int main()
{
    double s,n,p,k;
    while((scanf("%lf %lf",&n,&p))!=EOF)
    {
    s=1.0/n;
    k=pow(p,s);
    printf("%.0lf\n",k);
    }

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n,i,j,c;
    for(j=1;;j++)
    {
        scanf("%d",&n);
        if(n<0)
        {
            break;
        }
        c=0;
        for(i=1;;)
        {
            if(i>=n)
            {
                break;
            }
            else
            {
                i=2*i;
                c++;
            }

        }
            printf("Case %d: %d\n",j,c);

    }
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main()
{
    long long int h,o;
    while ((scanf("%lld %lld",&h,&o))!=EOF)
    {
        if(h>o)
        {
            printf("%lld\n",h-o);
        }
        else
        {
            printf("%lld\n",o-h);
        }
    }

    return 0;
}

#include <bits/stdc++.h>

#define ms(a,b)         memset(a,b,sizeof(a))
#define pb(a)           push_back(a)
#define db              double
#define ft              float
#define ll              long long
#define ull             unsigned long long
#define ff              first
#define ss              second
#define sz(x)           x.size()
#define qu              queue
#define pqu             priority_queue
#define vc              vector
#define vi              vector<int>
#define vll             vector<long long>
#define pii             pair<int,int>
#define pis             pair<int,string>
#define psi             pair<string,int>
#define all(x)          x.begin(),x.end()
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n)      for(int i=0;i<n;i++)
#define loop1(i,n)      for(int i=1;i<=n;i++)
#define stlloop(x)     for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b)       __gcd(a, b)
#define lcm(a, b)       ((a)*((b)/gcd(a,b)))
#define case(z,x)       cout<<"Case "<<i<<": "<<x<<endl
#define case(z)         cout<<"Case "<<z<<": "
#define PI              3.14159265358979323846264338328
#define valid(tx,ty)    tx>=0 && tx<r && ty>=0 && ty<c
#define MAX             2000

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

using namespace std;

int main()
{
    CIN;
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int r,d,sum,t,n,x;
    cin>>t;
    loop1(z,t)
    {
        cin>>n;
        x=n;
        while(1)
        {
            int sum=0;
            while(n!=0)
            {
                d=n;
                n=d/10;
                r=d%10;
                sum=sum+(r*r);
            }
            n=sum;
            if(n==1)
            {
                cout<<"Case #"<<z<<": "<<x<<" is a Happy number."<<endl;
                break;
            }
            else if(n!=1 && n<=9)
            {
                cout<<"Case #"<<z<<": "<<x<<" is an Unhappy number."<<endl;
                break;
            }
        }
    }
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main()
{
    long long int m,n,d,i,b,rvrs;
    for(;;)
    {
        scanf("%lld",&n);
        d=n;
        rvrs=0;
        while(n!=0)
        {
           rvrs=rvrs*10;
           rvrs=rvrs+(n%10);
           n=n/10;
        }

        if(d==rvrs)
        {
            b=0;
            for(i=2;i<d;i++)
            {
                if(d%i==0)
                {
                    b=1;
                    break;
                }
            }
            if(b==1)
            {
                m=2*d;
                printf("%lld\n",m);
            }

            else
            {
                m=2*d;
                printf("%lld\n",m);
                break;
            }
        }
        else
        {
            m=2*d;
            printf("%lld\n",m);
        }
    }

    return 0;
}