# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2000000000;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)   FOR(i,0,n)
#define ALL(x)    (x).begin(),(x).end()
#define UNIQ(c)   (c).erase(unique(ALL((c))), end((c)))
#define mp        make_pair
#define eb        emplace_back
//typedef pair<LL, LL> P;
//typedef pair<P, P> PP;

LL dp[101010][2][2][3];//keta,less,has3,mod3,mod8
LL dp2[101010][2][2][3][8];
string a;
int n;
int m;
const LL MOD = LINF;

int main() {
	cin >> m;
	a += '1';
	REP(i, m)a += '0';
	n = a.length();
	dp[0][0][0][0] = 1;
	REP(i, n)REP(j, 2)REP(k, 2)REP(l, 3) {
		int lim = (j ? 9 : a[i] - '0');
		REP(d, lim + 1) {
			(dp[i + 1][j || d < lim][k || d == 3][(l + d) % 3] += dp[i][j][k][l]) %= MOD;
		}
	}
	LL ans = 0;
	REP(j, 2)REP(k, 2)REP(l, 3)if ((k || l == 0))(ans += dp[n][j][k][l]) %= MOD;
	cout << ans-1 << endl;
	//system("pause");
}