import std.stdio, std.string, std.conv, std.range, std.array, std.algorithm;
import std.uni, std.math, std.container, std.typecons, std.typetuple;
import core.bitop, std.datetime;

immutable long mod = 10^^9 + 7;

void main(){
    auto p = readln.chomp.to!int;
    auto s = "1" ~ repeat("0", p).join;

    //s.writeln;

    long ans = nabeatsu(s, false) - 1;

    writeln(ans);
}

long nabeatsu(string n, bool miman){
    int L = n.length.to!int;
    auto dp = new long[][][][](L + 1, 2, 2, 3);
    dp[0][0][0][0] = 1;

    foreach(i ; 0 .. L) foreach(j ; 0 .. 2) foreach(k ; 0 .. 2) foreach(l ; 0 .. 3) {
        for(int d = 0; d <= (j ? 9 : n[i] - '0'); d++){
            dp[i + 1][j || (d < n[i] - '0')][k || (d == 3)][(l + d) % 3] += dp[i][j][k][l];
        }
    }

    long ans;

    foreach(j ; 0 .. 2) foreach(k ; 0 .. 2) foreach(l ; 0 .. 3) {
        if (k || (l == 0)) {
            ans += dp[L][j][k][l];
        }
    }

    return ans;
}


void readVars(T...)(auto ref T args){
    auto line = readln.split;
    foreach(ref arg ; args){
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    if(!line.empty){
        throw new Exception("args num < input num");
    }
}