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
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef unsigned int uint;

const int INF = 1e9 + 9;

struct End {
  int day=0, hour=0, minute=0, second=0;
};

const vector ROUNDS = {
  End(),
  End{24, 23, 59, 59},
  End{25, 23, 59, 59},
  End{26, 23, 59, 59},
  End{27, 23, 59, 59},
  End{29, 23, 59, 59},
};

struct Case {
    void solve() {
      int round, day, hour, minute;
      cin >> round >> day >> hour >> minute;
      auto end = ROUNDS[round];
      int diff_minutes = ((end.day - day) * 24 + (end.hour - hour)) * 60 + (end.minute - minute) + 1;
      if (round == 5 and (day < 29 or (day == 29 and hour < 2))) {
        diff_minutes -= 60;
      }
      cout << diff_minutes << "\n";
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int z = 1;
    // cin >> z;
    while (z--) {
        Case().solve();
    }
}