#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
using ll =long long;
template<class T> bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}

void solve(){
    struct day{
        int y;
        int m;
        int d;
    };
    auto leap=[&](int a)->bool{
        if(a%400==0) return true;
        if(a%100==0) return false;
        if(a%4==0) return true;
        return false;
    };
    vector<int> p={0,31,28,31,30,31,30,31,31,30,31,30,31};
    assert((int)p.size()==13);
    vector<day> q;
    int Y=1970,M=1,D=1;
    int R=0;
    while(Y<=2037){
        if(Y==2023&&M==1&&D==2) R=(int)q.size();
        q.push_back({Y,M,D});
        D++;
        if(p[M]<D){
            if(M!=2||D!=29||!leap(Y)){
                D=1;
                M++;
                if(M==13) M=1,Y++;
            }
        }
    }
    //cout<<q.size()<<endl;
    //cout<<68*365<<endl;
    int N;
    cin>>N;
    int ans=0;
    rep(i,0,q.size()){
        if(q[i].y==N&&i%7==R%7){
            ans++;
            if(2<=q[i].d&&q[i].d<=7) ans++;
        }
    }
    cout<<ans<<"\n";
}


int main() {
    solve();
}