#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

bool leap (int year) {
    return year % 4 == 0;
}

void solve() {
    int f = 6;

    int n; cin >> n;

    int cur = 2023;
    while (n < cur) {
        cur--;
        if (leap (cur)) f = (f - 2 + 7) % 7;
        else f = (f - 1 + 7) % 7;
    }

    while (cur < n) {
        if (leap (cur)) f = (f + 2 + 7) % 7;
        else f = (f + 1 + 7) % 7;
        cur++;
    }
    vector<int> months = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    if (leap (n)) months[1]++;

    // if (n == 1970) assert (f == 4);
    // if (n == 2037) assert (f == 4);
    // if (n == 2036) assert (f == 2);
    // if (n == 2030) assert (f == 2);
    // if (n == 2031) assert (f == 3);
    // if (n == 2028) assert (f == 6);

    int ans = 0;
    for (auto u : months) {
        int tabela = f + u;
        ans += (tabela + 6) / 7;
        f = (f + u) % 7;
    }

    cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	solve();
}