Untitled

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define all(x)       (x).begin(), (x).end()
#define asort(s)     (sort(s.begin(), s.end()))
#define t_sum(sv)    (accumulate(sv.begin(),sv.end(),0ll))
#define dsort(s)     (sort(s.begin(), s.end(),greater <>()))
#define scan(n,x)    for(ll i=0 ; i<n ; i++) {ll nx; cin >> nx; x.pb(nx);}
#define print(x)     for(auto &value : x){ cout << value << " ";}cout << endl;  
#define sz(v)        ((ll)(v).size())
#define pi 3.141592654
#define pb           push_back
#define w(n)         while(n--)
#define f            first
#define s            second
#define YES          cout << "YES" << endl;
#define NO           cout << "NO"  << endl;
#define Yes          cout << "Yes" << endl;
#define No           cout << "No"  << endl;
#pragma GCC optimize("Ofast")
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

ll c_zero(long long n, ll b)
{
    ll count = 0;
    while (n % b == 0)
    {
        count++;
        n /= b;
    }
    return count;
}

int main()
{
    ll n;
    cin >> n;
    ll ans=0, max_0 = INT_MIN;
    for (ll b = 2; b <= n; b++)
    {
        ll z = c_zero(n, b);
        if (z > max_0)
        {
            max_0 = z;
            ans = b;
        }
    }

    cout << ans << endl;
    return 0;
}