#include <bits/stdc++.h>
using namespace std;
#define REP(i,N) for(i=0;i<N;i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct{
  int first;
  int second;
  int third;
}T;

//昇順
bool comp_Se(T& l, T& r){
  return l.second < r.second;
}

int main(void){
  int N[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
  int i,j,n=12,count=0;
  REP(i,n){
    REP(j,N[i]){
      if(i+1 == (j+1)/10+(j+1)%10)count++;
    }
  }
  cout << count << endl;
  return 0;
}