#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,sizeof(a))

typedef pair<int,int> P;
typedef vector<pair<int,string> > pii;
typedef map<string,int> mdi;



int main(){
	int A[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
	int cnt=0;
	for(int i=1;i<13;i++){
		for(int j=1;j<A[i];j++){
			string s;
			stringstream ss;
	    	ss << j;
	    	ss >> s;
			if(s.size()==1){
				if(s[0]-'0'==i) cnt++;	
			}
			else if(i==s[0]-'0'+s[1]-'0') cnt++;
		}
	}
	cout << cnt << endl;
	
	return 0;
}