#include <iostream>
#include <vector>
#include <algorithm>

std::vector<int> prime_list(int max) {
  std::vector<int> list(max + 1);
  int i = -1;
  for (auto &x: list)
    x = ++i;
  list[0] = 0;
  list[1] = 0;
  for (i = 2; i <= max; ++i)
    if (list[i] != 0)
      for (int j = 2; j <= max / i; ++j)
        list[i * j] = 0;
  std::sort(list.begin(), list.end());
  auto result = std::unique(list.begin(), list.end());
  return std::vector<int>(list.begin() + 1, result);
}

int main() {
  std::vector<int> prime;

  int n, k;
  std::cin >> n >> k;

  // for(int prime: prime_list(n / 2))
  //   std::cout << prime << " ";

  for(int prime: prime_list(n / 2)) {
    if (n % prime == 0) {
      std::cout << (n / prime) << std::endl;
      return 0;
    }
  }
  std::cout << 1 << std::endl;
  return 0;
}