#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

int days ( int x ) {
    if ( ( x % 4 == 0 && x % 100 != 0 ) || ( x % 400 == 0 ) ) { return 366 ; }
    return 365 ;
}

int month ( int y , int m ) {
    if ( m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12 ) { return 31 ; }
    if ( m == 4 || m == 6 || m == 9 || m == 11 ) { return 30 ; }
    if ( days ( y ) == 366 ) { return 29 ; }
    return 28 ;
}

void solve ( ) {
    int n ; cin >> n ;
    int wh = 2023 , day = 6 ;
    while ( wh != n ) {
        if ( wh < n ) {
            day = ( day + days ( wh ) ) % 7 ;
            ++ wh ;
        }
        else {
            day = ( day - days ( wh - 1 ) + 700 ) % 7 ;
            -- wh ;
        }
    }
    int m = 1 ;
    int ans = 0 ;
    while ( m <= 12 ) {
        int st = day , en = day + month ( n , m ) - 1 ;
        ans += ( en + 7 ) / 7 ;
        day = ( en + 1 ) % 7 ;
        ++ m ;
    }
    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}