#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N;
    cin >> N;

    vector<int> F(100000);
    F[1] = F[2] = 1;
    for (int i = 3; i < 100000; i++) {
        F[i] = (F[i - 1] + F[i - 2]) % N;
    }

    vector<int> d;
    for (int i = 1; i < 100000; i++) {
        if (F[i] == 0) {
            d.push_back(i);
        }
    }

    int ans = 0;
    for (int x : d) {
        ans = gcd(ans, x);
    }

    cout << ans << endl;
}