Envío 5606

Código

#include <bits/stdc++.h>
#include <queue>
#define REP(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ff first
#define ss second
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define lli long long int
#define fast_io                                                                \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0);
using namespace std;
ostream &operator<<(ostream &os, const vector<int> &v) {
  for (auto const &i : v) {
    os << i << " ";
  }
  os << endl;
  return os;
}
const lli mod = (1e9) + 7;
const int N = 1e4 + 1;
int main() {
  fast_io;
  int clases;
  cin >> clases;
  priority_queue<ii, vii, greater<ii>> pq;
  string inicio, fin;
  REP(i, clases) {
    cin >> inicio;
    cin >> fin;
    pq.push(ii(stoi(inicio.substr(0, 2) + inicio.substr(3, 2)), 1));
    pq.push(ii(stoi(fin.substr(0, 2) + fin.substr(3, 2)), 0));
  }
  bool start = true;
  int ans = 0;
  int cnt = 0;
  while(!pq.empty()){
    auto curr = pq.top();
    int hr = curr.ff;
    int abre = curr.ss;
    if(abre){
      cnt++;
    }
    else{
      cnt--;
    }
    //cout<<curr.ff<<" : "<<curr.ss<<" cnt "<<cnt<<endl;
    ans = max(ans,cnt);
    pq.pop();
  }
  cout<<ans<<endl;
  return 0;
}