#include <iostream>
#include <vector>
#include <queue>
#include <string>

using namespace std;

typedef vector<long long> vec;
typedef vector<vec> mat;
typedef long long ll;

const int M = 100;

mat mul(mat &A, mat &B){
    mat C(A.size(), vec(B[0].size()));
    for (int i = 0; i < A.size(); i++){
        for(int k=0; k < B.size();k++){
            for(int j=0;j<B[0].size();j++){
                C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % M;
            }
        }
    }
    return C;
}

mat pow(mat A, ll n){
    mat B(A.size(), vec(A.size()));
    for(int i=0;i<A.size();i++){
        B[i][i] = 1;
    }
    while( n > 0 ){
        if( n & 1){
            B = mul(B, A);
            A = mul(A, A);
            n >>= 1;
        }
    }
    return B;
}


int main(void){
    mat A(2, vec(2));
    A[0][0] = 1;
    A[0][1] = 1;
    A[1][0] = 1;
    A[1][1] = 0;
    ll n;
    cin >> n;

    A = pow(A, n);
    
    long long ans = A[1][0];
    
    A= mat(2, vec(2));
    
    A[0][0] = 1;
    A[0][1] = 1;
    A[1][0] = 1;
    A[1][1] = 0;
    
    A = pow(A, ans);
    
	cout << A[1][0] << endl;
    return 0;
}