#include <iostream>
using namespace std;

int fib[3]={0,1,0},m,n=2;

int f(int mod){
	while(1){
		fib[2] = (fib[0]+fib[1])%mod;
		if(fib[2] == 1 && fib[1] == 0) return n-1;
		fib[0] = fib[1];
		fib[1] = fib[2];
		n++;
 	}
}
int main(){
	cin >> m;
	cout << f(m);
	
	return 0;
}