import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) throws IOException {
		new Main().run();
	}
	
	long pow(long a, long n) {
		if (n==0) return 1;
		return pow(a*a%mod, n/2) * (n%2==1?a:1) % mod;
	}
	
	long inv(long a) {
		return pow(a, mod-2);
	}
	
	final long mod=(long)1e9+7;
	
	long[][] mul(long[][] a, long[][] b) {
		long[][] c=new long[a.length][b[0].length];
		for (int i=0;i<a.length;++i) {
			for (int j=0;j<b[0].length;++j) {
				for (int k=0;k<a[i].length;++k) {
					c[i][j]+=a[i][k]*b[k][j]%mod;
					c[i][j]%=mod;
				}
			}
		}
		return c;
	}
	
	long[][] pow(long[][] a, long n) {
		long[][] ret=new long[a.length][a.length];
		for (int i=0;i<a.length;++i) ret[i][i]=1;
		if (n==0) return ret;
		ret=pow(mul(a, a), n/2);
		if (n%2==1) ret=mul(ret, a);
		return ret;
	}
	
	long f(long n) {
		if (n % 2 == 0) {
			long[][] mat=new long[][] {{1, 1}, {1, 0}};
			long[][] vec=new long[][] {{1}, {0}};
			vec = mul(pow(mat, n/2), vec);
			return vec[0][0];
		} else {
			long[][] mat=new long[][] {{2, 1, mod-2, mod-1}, {1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}};
			long[][] vec=new long[][] {{15}, {7}, {3}, {1}};
			if ((n-1)/2 <= 3) return vec[(int)(3-(n-1)/2)][0];
			vec = mul(pow(mat, (n-1)/2-3), vec);
			return vec[0][0];
		}
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		PrintWriter pw=new PrintWriter(System.out);
		long n=sc.nextLong();
		System.out.println(f(n));
		pw.close();		
	}
	

	
	void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}