#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 10000;
constexpr int M = N * (N - 1) / 2;

int f[M + 1];
std::bitset<M + 1> isprime;
std::bitset<M + 1> vis;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    if (n == 1) {
        std::cout << 1 << "\n";
        return 0;
    }
    
    int m = n * (n - 1) / 2;
    
    for (int i = 2; i <= m; i++) {
        isprime[i] = 1;
    }
    for (int i = 2; i <= n; i++) {
        if (isprime[i]) {
            for (int j = i * i; j <= m; j += i) {
                isprime[j] = false;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        f[i] = i;
    }
    for (int i = 2; i <= m; i++) {
        if (isprime[i]) {
            for (int j = 1; j <= m / i; j++) {
                f[i * j] += f[j];
            }
        }
    }
    for (int i = 1; i <= m; i++) {
        f[i] += f[i - 1];
    }
    for (int i = 0; i <= m; i++) {
        f[i] = i * n - f[i];
    }
    
    int ans = 0;
    for (int i = 0; i <= m; i++) {
        if (vis[i]) {
            continue;
        }
        int j = i;
        int len = 0;
        while (!vis[j]) {
            vis[j] = true;
            j = f[j];
            len++;
        }
        int k = j;
        for (int l = 1; l <= len; l++) {
            k = f[k];
            if (k == j) {
                ans = std::max(ans, l);
                break;
            }
        }
    }
    std::cout << ans << "\n";
    
    return 0;
}