1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef double db;
typedef pair<int, int> pii;
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size()
#define rep(i, l, r) for(int i=l; i<(r); i++)

int xd(int d, int h, int m) {
    int ans = 24*60*d + 60*h + m;
    if(make_pair(d, h) >= make_pair(29, 2)) ans-=60;
    return ans;
}

int dni[5] = {24, 25, 26, 27, 29};

void solve(){
    int x, d, h, m;
    cin >> x >> d >> h >> m;
    cout << xd(dni[x-1]+1, 0, 0) - xd(d, h, m) << "\n";
}

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