// yukicoder: No.136 Yet Another GCD Problem
// 2019.4.13 bal4u

#include <stdio.h>
#include <math.h>

int main()
{
	int a, b, N, K, ans;

	scanf("%d%d", &N, &K);
	if ((N & 1) == 0) ans = N >> 1;
	else {
		b = (int)sqrt(N);
		for (a = 3; a <= b; a += 2) {
			if (N % a == 0) break;
		}
		if (a > b) ans = 1;
		else ans = N / a;
	}
	printf("%d\n", ans);
	return 0;
}