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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p); i<=(k); ++i)
#define FORL(i,p,k) for(long long i=(p); i<=(k); ++i)
#define RFOR(i,p,k) for(int i=(p); i>=(k); --i)
#define REP(i,k) FOR(i,0,(k)-1)
#define FORC(init,cond,inc) for(init; cond; inc)
#define FORPWK(pw,k,cond) for(int pw = 1, k = 1; cond; pw *= 2, ++k)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).end(), (x).begin()
#define siz(x) int((x).size())
#define f first
#define s second
#define v vector
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define C const
using namespace std;
typedef long long ll;
typedef v<int> vi;
typedef v<long long> vl;
typedef C int ci;
typedef C ll cll;
typedef pair<int, int> pii;
template<typename T>
using V = vector<T>;

inline void solve(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int x, d, h, m;
	cin >> x >> d >> h >> m;
	int wyn = 0;
	if(x == 1){
		if(d == 23){
			wyn = (24 * 60 - h * 60 - m) + 24 * 60; 
			}
		else{
			wyn = (24 * 60 - h * 60 - m);
			}
		}
		
	else if(x == 2){
		if(d == 24){
			wyn = (24 * 60 - h * 60 - m) + 24 * 60; 
			}
		else{
			wyn = (24 * 60 - h * 60 - m);
			}
		}
		
		else if(x == 3){
		if(d == 25){
			wyn = (24 * 60 - h * 60 - m) + 24 * 60; 
			}
		else{
			wyn = (24 * 60 - h * 60 - m);
			}
		}
		
		else if(x == 4){
		if(d == 26){
			wyn = (24 * 60 - h * 60 - m) + 24 * 60; 
			}
		else{
			wyn = (24 * 60 - h * 60 - m);
			}
		}
		
	else{
		if(d == 27){
			wyn = (24 * 60 - h * 60 - m - 60) + 24 * 60 * 2; 
			}
		else if(d == 28){
			wyn = (24 * 60 - h * 60 - m - 60) + 24 * 60;
			}
		else{
			if(h < 2){
				wyn = (24 * 60 - h * 60 - m - 60);
				}
			else{
				wyn = (24 * 60 - h * 60 - m);
				}
			}
		}
	cout << wyn << "\n";
	}

signed main(){
	int tt = 1;
	while(tt--) solve();
}