#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

#define MAX 100000
int b[MAX] = {0};

// 因数分解
void ib(int n, int b[MAX]) {
    int k = 2;
    while (n > 1 && k < MAX) {
        if (n % k == 0) {
            b[k]++;
            n /= k;
            continue;
        }
        k++;
    }
}

signed main()
{
    int N, K;
    cin >> N >> K;
    ib(N, b);
    int minb = 0;
    REP(i,MAX) {
        if (b[i] > 0) {
            minb = i;
            break;
        }
    }
    if (minb % 2 == 0) {
        int ret = N / 2;
        cout << ret << endl;
    } else {
        int ret = N / minb;
        cout << ret << endl;
    }

    return 0;
}