#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
 
const int inf = (int)1e9; 


int main(void){
    int n,k;
    cin>>n>>k;
    vector<int>d;
    for(int i=1;i*i<=n;i++){
        if(n%i==0){
            int t = n/i;
            if(i==t)d.push_back(t);
            else{
                d.push_back(i);
                d.push_back(t);
            }
        }
    }
    sort(d.begin(),d.end(),greater<int>());
    for(int i=0;i<d.size();i++){
        int now = n/d[i];
        if(d[i]==1)continue;
        if(now==1)continue;
        else{
            cout<<d[i]<<endl;
            return 0;
        }
    }
    cout<<1<<endl;
    return 0;
}