import java.util.ArrayList;
import java.util.List;

public class Euler618 {
    static final long MOD = 1000000000L;

    static List<Integer> sievePrimes(int n) {
        boolean[] isPrime = new boolean[n + 1];
        for (int i = 2; i <= n; i++)
            isPrime[i] = true;
        for (int p = 2; (long) p * p <= n; p++) {
            if (isPrime[p]) {
                for (int j = p * p; j <= n; j += p) {
                    isPrime[j] = false;
                }
            }
        }
        List<Integer> primes = new ArrayList<>();
        for (int i = 2; i <= n; i++) {
            if (isPrime[i])
                primes.add(i);
        }
        return primes;
    }

    public static String solve() {
        int[] F = new int[25];
        F[1] = 1;
        F[2] = 1;
        for (int i = 3; i <= 24; i++) {
            F[i] = F[i - 1] + F[i - 2];
        }

        int K = F[24];

        List<Integer> primes = sievePrimes(K);
        long[] dp = new long[K + 1];
        dp[0] = 1;

        for (int p : primes) {
            for (int k = p; k <= K; k++) {
                dp[k] += (long) p * dp[k - p] % MOD;
                if (dp[k] >= MOD)
                    dp[k] -= MOD;
            }
        }

        long ans = 0;
        for (int i = 2; i <= 24; i++) {
            ans += dp[F[i]];
            ans %= MOD;
        }

        return String.format("%09d", ans);
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}