#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a[1041501];
ll b[1020021];
ll nodg[1002105];
ll m;
ll dg(int n){
	if(nodg[n]) return nodg[n];
	if(n==1||n==2) return nodg[n]=(1+m)%m;
	return nodg[n]=(dg(n-1)+dg(n-2)+m)%m;
}
int main(){
	scanf("%d",&m);
	a[0]=0;
	a[1]=1;
	ll i=1;
	while(1){	
		if(dg(i)==0&&dg(i+1)==1){
		cout<<i;
		return 0;	
		}
		i++;
	}
	return 0;
}