// 誤解法（O(F_k)再帰解）チェック
#pragma GCC optimize ( "O3" )
#pragma GCC optimize( "unroll-loops" )
#pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )
#include <iostream>
#include <cassert>
using namespace std;

#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#define CEXPR( LL , BOUND , VALUE ) constexpr const LL BOUND = VALUE 
#define CIN( LL , A ) LL A; cin >> A 
#define ASSERT( A , MIN , MAX ) assert( MIN <= A && A <= MAX ) 
#define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); ASSERT( A , MIN , MAX ) 
#define QUIT return 0 
#define COUT( ANSWER ) cout << ( ANSWER ) << "\n"; 
#define RETURN( ANSWER ) COUT( ANSWER ); QUIT 

int F( const int& n , const int& N ) { return N == 1 ? 0 : n <= 2 ? 1 : ( F( n - 1 , N ) + F( n - 2 , N ) ) % N; }

int main()
{
  UNTIE;
  CEXPR( int , bound_N , 400 );
  CIN_ASSERT( N , 1 , bound_N );
  int k = 1;
  while( true ){
    if( F( k , N ) == 0 ){
      RETURN( k );
    }
    k++;
  }
  QUIT;
}