#include <bits/stdc++.h>
using namespace std;
long long n,z=0,y=0;
int main()
{
    cin >> n;
    for (long long i = n; i >= 0; i++)
    {
        double t = sqrt(i);
        if (t == (int)sqrt(i))
        {
            z = i;
            break;
        }
    }
    for (long long i = n; i >= 0; i--)
    {
        double t = sqrt(i);
        if (t == (int)sqrt(i))
        {
            y = i;
            break;
        }
    }
    if (n - y > z - n)
        cout << z;
    else
        cout << y;
}

#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long md(long long a, long long n)
{
    if (n==0) return 1;
    long long k=md(a,n/2)%mod;
    k=(k*k)%mod;
    if (n%2) k=(k*a) % mod;
    return k;
}
long long a, n;
int main()
{
    cin >> a >> n;
    cout << md(a, n);
}

#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long n;
cin>>n;
long long l=floor(sqrt(n));
long long u=ceil(sqrt(n));
long long l2=l*l;
long long u2=u*u;
if (abs(n-l2)<=abs(n-u2)) {
cout<<l2<<endl;
} else {
cout<<u2<<endl;
}
return 0;
}

#include <iostream>
using namespace std;
const long long m=1000000007;
int main() {
long long a,n,r=1;
cin>>a>>n;
while (n>0) {
if (n%2==1) r=r*a%m;
a=a*a%m;
n/=2;
}
cout<<r<<endl;
return 0;
}