#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mod 1000000007
int n;
int dp[1000001][2][2];
int solve(int in, int ze, int ni)
{
	if (in == n)
	{
		if (ze && ni)
		{
			return 1;
		}
		return 0;
	}
	int ans = 0;
	if (dp[in][ze][ni] != -1)
	{
		return dp[in][ze][ni];
	}
	for (int i = 0; i <= 9; i++)
	{
		ans = ans + solve(in + 1, ((i == 0) ? 1 : ze), ((i == 9) ? 1 : ni));
		ans %= mod;
	}
	return dp[in][ze][ni] = ans;
}
int32_t main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int tc = 1;
	while (tc--)
	{
		memset(dp, -1, sizeof(dp));
		cin >> n;
		cout << solve(0, 0, 0);
	}

	return 0;
}