#include <bits/stdc++.h>
using namespace std;

#define rep(i, j, n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};

bool PrimeNumber(i64 n) {
  if(n < 2) return false;
  for(i64 i = 2; i * i <= n; ++i) {
    if(n % i == 0) return false;
  }
  return true;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  i64 n;
  cin >> n;
  if(n == 4) return cout << 4 << endl, 0;

  for(i64 i = 3; i * i <= n; ++i) {
    if(n % i == 0) return cout << i << endl, 0;
  }
  cout << (n % 2 == 0? n / 2 : n) << endl;
}