#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAX = 1e5 + 10, inf = 2e9, mod = 998244353;

/*int n, m;
string s;
ll power(ll x, int y){
    ll ans = 1;
    while (y){
        if (y & 1) ans *= x, ans %= mod;
        x *= x, x %= mod;
        y >>= 1;
    }
    return ans;
}
vector<int> kmp(string b){
    vector<int> nex(b.size());
    int i = 1, j = 0, prelen = 0;
    while (i < b.size()){
        if (b[prelen] == b[i]) nex[i ++] = ++ prelen;
        else{
            if (prelen == 0) nex[i ++] = 0;
            else prelen = nex[prelen - 1];
        }
    }
    return nex;
}
void solve(){
	cin >> n >> m >> s;
	vector<int> v = kmp(s);
	ll sum = 1;
	for (int i: v) cerr << i << ' ';
	for (int i = 0; i < min(n - 1, m - n); ++ i) sum = (sum * (26 - v[i])) % mod;
	cout << sum - v[min(n - 1,m - n)];
}*/
int day[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
void solve(){
	int y;cin >> y;
	int d = 1, m = 1;
	int w = (3 + 365 * (y - 1970) + (y - 1970 + 2) / 4) % 7;
	int ans = 0, cnt = 1;
	if (y % 4 == 0) day[2] = 29, w = (w + 6) % 7;
	while (m < 13){
		if (w == 7) w = 0, cnt ++;
		w ++; d ++;
		if (d > day[m]) m ++, d = 1, ans += cnt, cnt = (w != 7);
	}
	cout << ans;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //cout << fixed << setprecision(10);
    //while (cin >> n)
    //int _;cin >> _;while (_ --)
    	solve();
    return 0;
}