#include <iostream>
using namespace std;

int main()
{
  int N; cin >> N;
  int k = 1;
  int F[2] = { 0 , 1 };
  int i_prev = 0;
  int i_curr = 1;
  while( true ){
    ( F[i_curr] += F[i_prev] ) %= N;
    if( F[i_curr] == 0 ){
      cout << k << "\n";
      return 0;
    }
    k++;
    swap( i_prev , i_curr );
  }
  return 0;
}