#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ll long long 
#define P pair<int,int>
#define LP pair<ll,ll>
using namespace std;
int main() {
	int d1[] = {1,3,5,7,8,10,12};
	int d2[] = {4,6,9,11};
	int cnt1 = 0, cnt2=0,cnt3=0;
	for (int i=0 ; i <7; i++) {
		for (int j=1;j<32;j++){
			int a = d1[i];
			if (j<10) {
				if (a == j) cnt1++;
			}
			else {
				if (a == j / 10 + j % 10) cnt1++;
			}
		}
	}
	for (int i = 0; i < 4; i++) {
		for (int j = 1; j < 31; j++) {
			int b = d2[i];
			if (j < 10) {
				if (b == j) cnt2++;
			}
			else {
				if (b == j / 10 + j % 10) cnt2++;
			}
		}
	}
		for (int j = 1; j < 29; j++) {
			if (j < 10) {
				if (2== j) cnt3++;
			}
			else {
				if (2 == j / 10 + j % 10) cnt3++;
			}
		}
	
    cout << cnt1*7+cnt2*4+cnt3 << endl;

	return 0;
}