import java.util.Scanner;

/**
 * 앤黎우醵헹쵸
 * @author RXJ
 *
 */
public class MatrixMulti {
	static int MOD=19999997;
	/**
	 * 앤黎넉랬頓炬
	 * @param A
	 * @param B
	 * @return
	 */
	public static long[][] f(long[][] A,long[][] B){
 long res[][] = new long[A.length][B.length];
 for(int i = 0 ; i < res.length ;i++){
 for(int j = 0 ; j< res[i].length ;j++){
 	res[i][j]=0;
 for(int k = 0 ; k < A[0].length ;k++){
 res[i][j] +=( A[i][k]*B[k][j])%MOD;
 }
 res[i][j]%=MOD;
 }
 }
 return res;
 }
	
	/**앤黎우醵헹쵸
	 * @param k
	 * @param n
	 * @param A
	 * @return
	 */
	public static long[][] mut(int k,int n,long[][] A){
 long [][] res = new long[n][n];
 for(int i = 0 ; i < res.length ;i++){
 for(int j = 0 ; j< res[i].length ;j++){
 if(i==j){
 res[i][j] = 1;
 }else{
 res[i][j] = 0;
 }
 }
 }
 while(k!=0){
 if((k&1)==1){
 	res = f(res,A);
 }
 k>>=1;
 A = f(A,A);
 }
 return res;
 }
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		int value = in.nextInt();
		long[][] a ={{0,1},{1,1}};
		long[][] result =mut(value+1, 2, a);
		/*long[][] b={{0,1}};
		result=f(b, result);*/
		/*long max=0;*/
		/*for(int i=0;i<result[0].length;i++){
			for(int j=0;j<result.length;j++){
				System.out.print(result[j][i]+" ");
				max=max>result[j][i]?max:result[j][i];
			}
			System.out.println();

		}*/
		System.out.println(result[0][1]%MOD);
	}
}