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

int md[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

bool is_leap(int y){
    if(y % 400 == 0) return 1;
    return y % 4 == 0 && y % 100 != 0;
}

int y,m,d;

void nxtd(){
    d ++;
    if(is_leap(y)) md[2] ++;
    if(d > md[m]){
        d = 1;
        m ++;
    }
    if(is_leap(y)) md[2] --;
    if(m > 12){
        m = 1;
        y ++;
    }
}

void pred(){
    d --;
    if(is_leap(y)) md[2] ++;
    if(d == 0){
        m --;
        d = md[m == 0 ? 12 : m];
    }
    if(is_leap(y)) md[2] --;
    if(m == 0){
        m = 12;
        y --;
    }
    // cout << y << ' ' << m << ' ' << d << endl;
}

int a[105][105][105];

void solve(){
    int cur;
    y = 2024; m = 1; d = 1; cur = 0;
    while(y <= 2037){
        a[y - 1970][m][d] = cur;
        cur = (cur + 1) % 7;
        nxtd();
    }
    y = 2024; m = 1; d = 1; cur = 0;
    while(y >= 1970){
        a[y - 1970][m][d] = cur;
        cur = (cur + 6) % 7;
        pred();
    }
    int ans = 0;
    cin >> y;
    if(is_leap(y)) md[2] ++;
    y -= 1970;
    for(int m = 1;m <= 12;m ++){
        ans ++;
        for(int d = 2;d <= md[m];d ++){
            if(a[y][m][d - 1] == 6 && a[y][m][d] == 0) ans ++;
        }
    }
    cout << ans << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    solve();
    return 0;
}