public class Euler301 {
    public static String solve() {
        int exponent = 30;
        int bits = exponent + 1;
        long[] fib = new long[bits + 2];
        fib[1] = 1L;
        for (int i = 2; i <= bits + 1; ++i) {
            fib[i] = fib[i - 1] + fib[i - 2];
        }
        return String.valueOf(fib[bits + 1]);
    }

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