#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
int main(void){
	int n;
	int k=0;
	int a,aa,b,bb;
	cin>>n;
	while(n--){
		scanf("%d:%d %d:%d",&a,&b,&aa,&bb);
		while(a!=aa||b!=bb){
			b++;
			a+=b/60;
			b%=60;
			a%=24;
			k++;
		}
	}

	cout<<k<<endl;
	return 0;
}