#include<bits/stdc++.h>
using namespace std;
bool vis[25],ans[25];
void O_o()
{
  int n,cnt=0,a[]={1,10,11,100,101,110,111,1000,1001,1010,1011,1100,1101,1110,1111,10000,10001,10010,10011,10100},b[]={1,2,10,11,12,20,21,22,100,101,102,110,111,112,120,121,122,200,201,202};
  cin>>n;
  for(int i=1;i<=n;i++)
  {
    for(int j=1;j<=n;j++)
    {
      int k=i+j;
      if(vis[k]) 
      {
        if(ans[k])  cnt++;
        continue;
      }
      bool p=true;
      int a1=a[i]+a[j],b1=b[i]+b[j];
      while(a1>0)
      {
        if(a1%10>1)
        {
          p=false;
          break;
        }
        a1/=10;
      }
      while(b1>0)
      {
        if(b1%10>2)
        {
          p=false;
          break;
        }
        b1/=10;
      }
      vis[k]=true;
      ans[k]=p;
      if(p) cnt++;
    }
  }
  cout<<cnt;
}
int main()
{
  //freopen(".in","r",stdin);
  //freopen(".out","w",stdout);
  int T=1;
  //cin>>T;
  while(T--)  O_o();
  return 0;
}