// Arup Guha
// 4/27/2024
// Solution to CSES Problem: Dice Combinations

import java.util.*;

public class dicecombinations {

	final public static long MOD = 1000000007L;
	
	public static void main(String[] args) {
		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();
		
		// Seed these answers.
		long[] dp = new long[n+1];
		dp[0] = 1;
		dp[1] = 1;
		
		// i is my sum.
		for (int i=2; i<=n; i++)

			// j is the last dice roll.
			for (int j=1; j<=6&&j<=i; j++)
				dp[i] = (dp[i] + dp[i-j])%MOD;
		
		// Ta da!
		System.out.println(dp[n]);
	}
}