#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;


int main(){
	int n,H,M,h,m,ans=0;
	cin>>n;
	rep(i,0,n){
		scanf("%d:%d %d:%d",&H,&M,&h,&m);
		int tmp=0;
		if(h<H||(h==H&&m<M)) tmp=(24-H+h)*60-M+m;
		else tmp=(h-H)*60+m-M;
		ans+=tmp;
	}
	o(ans);
}