#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

void solve(){
  ll n;
  cin >> n;
  ll ans = 0;
  rep(i,n){
  	string s,t;
  	cin >> s >> t;
  	ll x = 0, y = 0;
  	{
  	ll a = find(be(s), ':') - s.begin();
  	ll nn = s.size();
  	rep(j, a) x = x*10+s[j]-'0';
  	x *= 6;
  	if(nn-a == 2) x *= 10;
  	REP(j, a+1, nn) x = (x+s[j]-'0') * 10;
  	}
  	{
  	ll a = find(be(t), ':') - t.begin();
  	ll nn = t.size();
  	rep(j, a) y = y*10+t[j]-'0';
  	y *= 6;
  	if(nn-a == 2) y *= 10;
  	REP(j, a+1, nn) y = (y+t[j]-'0') * 10;
  	}
  // 	cout << x << " " << y << endl;
  	x /= 10;
  	y /= 10;
  	y = (y-x+1440)%1440;
  	ans += y;
  }
  cout << ans << endl;
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}