#include #define endl '\n' #define int long long #define lint long long #define pii pair #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() #define SZ(v) ((int)v.size()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) #define MINF(a) memset(a,0x3f,sizeof(a)) #define POW(n) (1LL<<(n)) #define POPCNT(n) (__builtin_popcount(n)) #define IN(i,a,b) (a <= i && i <= b) using namespace std; template inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; } template inline bool CHMAX(T& a,T b) { if(a inline void SORT(T& a) { sort(ALL(a)); } template inline void REV(T& a) { reverse(ALL(a)); } template inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); } template inline T LB(vector& v, T a) { return *lower_bound(ALL(v),a); } template inline int LBP(vector& v, T a) { return lower_bound(ALL(v),a) - v.begin(); } template inline T UB(vector& v, T a) { return *upper_bound(ALL(v),a); } template inline int UBP(vector& v, T a) { return upper_bound(ALL(v),a) - v.begin(); } template ostream& operator<< (ostream& os, const pair& p) { os << p.first << " " << p.second; return os; } template istream& operator>> (istream& is, pair& p) { is >> p.first >> p.second; return is; } template ostream& operator<< (ostream& os, const vector& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; } template istream& operator>> (istream& is, vector& v) { for(T& in : v) is >> in; return is; } template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value == 0>::type fill_v(T &t, const V &v) { t = v; } template typename enable_if::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); } const lint MOD = 1000000007; const lint INF = 0x3f3f3f3f3f3f3f3f; const double EPS = 1e-10; int P; int dp[20][3][2]; void _main() { cin >> P; dp[0][0][0] = 1; REP(i, P) REP(j, 3) REP(k, 2) { REP(d, 10) { dp[i + 1][(j + d) % 3][k | (d == 3)] += dp[i][j][k]; } } int ans = 0; REP(j, 3) REP(k, 2) { if (j == 0 || k == 1) { ans += dp[P][j][k]; } } cout << ans - 1 << endl; } signed main(signed argc, char **argv) { if (argc > 1) { if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin); if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout); } cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); _main(); return 0; }