#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

int day_of_week(int y, int m, int d) {
  if(m < 3) { m += 12, y -= 1; }
  return int((y + y/4 - y/100 + y/400 + (13 * m + 8) / 5 + d) % 7);
}

int main(void) {
  const int N = 400;
  i64 n; scanf("%lld", &n);
  int yy = 2014, m = 7, d = 23;
  int x = day_of_week(yy, m, d);
  i64 p = (n-yy) / N;
  int q = (n-yy) % N;
  vector<int> v(N);
  int nya = 0, nyo = 0;
  for(int i : range(N)) {
    int y = i + yy + 1;
    int dd = day_of_week(y, m, d);
    if(dd == x) {
      nya++;
      if(i < q) { nyo++; }
    }
  }
  i64 res = nya * p + nyo;
  printf("%lld\n", res);
  return 0;
}