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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define debug false

int main () {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int x, d, h, m;
    cin >> x >> d >> h >> m;

    int d2;
    if (x <= 4) {
        d2 = 23 + x;
    } else {
        d2 = 29;
    }

    int wyn = 24 * 60 * (d2 - d + 1);
    wyn -= h * 60;
    wyn -= m;

    if (x == 5) {
        if (d < 29) {
            wyn -= 60;
        } else if (h < 2) {
            wyn -= 60;
        }
    }

    cout << wyn << "\n";

    return 0;
}