#define ll long long
#include <iostream>
#include<string>
#include <cctype>
#include <algorithm>
#include <cstring>
#include <cmath>
#include<cstdio>
using namespace std;
ll m;
ll f[3]={0,1,1}, n;
void fb(ll m)
{
    for (ll i = 2;; ++i)
    {
        f[i % 3] = f[(i - 1) % 3] + f[(i - 2) % 3];
        if (f[i % 3] % m == 1 && f[(i - 1) % 3] % m == 0)
        {
            n = i - 1; break;
        }
    }
    return;
}
int main()
{
    cin >> m;
    fb(m);
    cout << n;
    return 0;
}