#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())




int days[12]={31,28,31,30,31,30,31,31,30,31,30,31};


int main(){
	int ans=0;
	for(int m=1;m<=12;m++){
		int s=0;
		for(int d=1;d<=days[m-1];d++){
			int a=d,s=0;
			while(a){s+=a%10;a/=10;}
			if(m==s)ans++;
		} 
	}
	cout<<ans<<endl;
	return 0;
}