#include <bits/stdc++.h>
#define endl '\n'
#define pll pair<ll, ll>
#define tll tuple<ll, ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define x first
#define y second
#define rep(i, j, k) for(int i = (j); i <= (k); i++)
#define per(i, j ,k) for(int i = (j); i >= (k); i--)
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 10;
const ll mod = 998244353;
const ll inf = 0x3f3f3f3f;

int fst[3000];
void init(){
	fst[1970] = 3;
	for (int i = 1971; i <= 2037; ++i){
		if (((i - 1) % 4 == 0 && (i - 1) % 100) || (i - 1) % 400 == 0)
			fst[i] = (fst[i - 1] + 2) % 7;
		else fst[i] = (fst[i - 1] + 1) % 7;
	}
}

int calculateTotalRowsInYear(int year) {
    int totalRows = 0;
    int dayOfWeek = fst[year];
    for (int month = 1; month <= 12; ++month) {
        int daysInMonth = 0;
        switch (month) {
            case 1: case 3: case 5: case 7: case 8: case 10: case 12:
                daysInMonth = 31;
                break;
            case 4: case 6: case 9: case 11:
                daysInMonth = 30;
                break;
            case 2:
                if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) {
                    daysInMonth = 29; // 闰年2月有29天
                } else {
                    daysInMonth = 28; // 平年2月有28天
                }
                break;
        }
        int rowsInMonth = (daysInMonth + dayOfWeek + 6) / 7;
        totalRows += rowsInMonth;
        dayOfWeek = (dayOfWeek + daysInMonth) % 7;
    }
    
    return totalRows;
}

void solve(){
	int n;
	cin >> n;
    cout << calculateTotalRowsInYear(n) << endl;
}

int main(){
    ios;
    //freopen("sample.txt", "r", stdin);
    //freopen("resout.txt", "w", stdout);
    init();
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}