#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
#define inf 100000000/*10^8*/
#define rep(i,l,r) for(int i=l;i<=r;i++)
const double EPS=1E-8;

////////////////////////////////////////


int main(){
    ll s=2014;
    ll n;cin>>n;
    ll ans=0;
    ll k=0;int sum=0;
    rep(i,1+2014,400+2014){
        if(i%400==0)sum+=2;
        else if(i%100==0)sum+=1;
        else if(i%4==0)sum+=2;
        else sum+=1;
        
        if(sum%7==0)k++;
    }
    ll t=(n-s)/400;
    ans+=t*k;
    s+=t*400;
    sum=0;
    while(s<n){
        s++;
        if(s%400==0)sum+=2;
        else if(s%100==0)sum+=1;
        else if(s%4==0)sum+=2;
        else sum+=1;
        
        if(sum%7==0)ans++;
    }
    cout<<ans<<endl;
    
    return 0;
}