#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int dayOfMonth(int y, int m) {
  switch (m) {
    case 1: case 3: case 5: case 7: case 8: case 10: case 12: return 31;
    case 4: case 6: case 9: case 11: return 30;
    case 2: return (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0)) ? 29 : 28;
    default: assert(false);
  }
}
// 0: Monday
int dayCount(int y, int m, int d) {
  if (m <= 2) --y, m += 12;
  return y * 365 + y / 4 - y / 100 + y / 400 + (m * 153 + 3) / 5 + d;
}

int main() {
  int Y;
  for (; ~scanf("%d", &Y); ) {
    int ans = 0;
    for (int m = 1; m <= 12; ++m) {
      const int D = dayOfMonth(Y, m);
      const int res = dayCount(Y, m, 0);
      for (int d = 1; d <= D; ++d) {
        if (d == 1 || (res + d) % 7 == 0) {
          ++ans;
        }
      }
// cerr<<m<<": "<<ans<<endl;
    }
    printf("%d\n", ans);
  }
  return 0;
}