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
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <tuple>
#include <bitset>

using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
typedef vector<ll> vll;

vll A;
ll n;


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int r, d, h, m;
    cin >> r >> d >> h >> m;

    int s = d*24*60 + h*60 + m;
    int e = (23+r)*24*60 + 24 * 60;
    
    if(r==5){
        e+=24*60;
    }

    int ans = e - s;

    int c = 29*24*60 + 2*60;
    
    if(c>s && c<e){
        ans -= 60;
    }
    


   cout << ans << "\n";

    return 0;
}