import java.math.BigInteger;

public class Euler137 {
    public static void main(String[] args) {
        int index = 15, need = 2 * index + 1;
        BigInteger f0 = BigInteger.ZERO, f1 = BigInteger.ONE;
        for (int i = 2; i <= need; i++) {
            BigInteger f2 = f0.add(f1);
            f0 = f1;
            f1 = f2;
        }
        System.out.println(f0.multiply(f1));
    }
}