#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T mypow(T x, T n, const T &p = -1) { //x^nをmodで割った余り if(p!=-1){ x%=p; } T ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; int dp[11][2]; void solve() { int n; cin>>n; int ans=0; if(n<=101)ans+=n/3-3; else{ int v[4]={0,3,6,9}; string s=to_string(n); memset(dp,0,sizeof(dp)); dp[0][0]=1; rep(i,s.size()){ rep(j,2){ rep(k,4){ if(!j){ if(s[i]-'0'>v[k]){ dp[i+1][1]+=dp[i][0]; } else if(s[i]-'0'==v[k]){ dp[i+1][0]+=dp[i][0]; } } else{ dp[i+1][j]+=dp[i][j]; } } } } ans=dp[s.size()][0]+dp[s.size()][1]; ans-=4; ans+=18; } cout<