Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		n := io.NextInt()
		if n == 0 {
			break
		}
		accum := make([]int, 86401)
		for i := 0; i < n; i++ {
			s, e := io.Next(), io.Next()
			hs, _ := strconv.Atoi(s[:2])
			ms, _ := strconv.Atoi(s[3:5])
			ss, _ := strconv.Atoi(s[6:8])
			accum[hs*60*60+ms*60+ss]++
			he, _ := strconv.Atoi(e[:2])
			me, _ := strconv.Atoi(e[3:5])
			se, _ := strconv.Atoi(e[6:8])
			accum[he*60*60+me*60+se]--
		}
		ans := 0
		for i := 1; i < 86401; i++ {
			accum[i] += accum[i-1]
			ans = intMax(accum[i], ans)
		}
		io.Println(ans)
	}
}

func intMax(a, b int) int {
	if a < b {
		return b
	}
	return a
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>


using namespace std;

const int INF=1e+8;

typedef struct{
	int start,end;
}jikan;

int jikanShori(int h,int m,int s){
	return h*3600+m*60+s;
}


//比較関数
int comp(const void *c1,const void *c2){
	jikan jikan1=*(jikan *)c1;
	jikan jikan2=*(jikan *)c2;
	
	int tmp1=jikan1.end;
	int tmp2=jikan2.end;
	
	return tmp1-tmp2;
}

int main(){
	int n,cnt,ans;
	int h,m,s;
	jikan interval[10001];
	
	
	while(cin>>n,n){
		cnt=1;
		ans=1;
		for(int i=0;i<10001;i++){
			interval[i].start=INF;
			interval[i].end=INF;
		}
		
		for(int i=0;i<n;i++){
			scanf("%d:%d:%d",&h,&m,&s);
			interval[i].start=jikanShori(h,m,s);
			scanf("%d:%d:%d",&h,&m,&s);
			interval[i].end=jikanShori(h,m,s);
		}
		
		qsort(interval,n+1,sizeof(jikan),comp);
		
		for(int i=0;i<n;i++){
			cnt=1;
			for(int j=i+1;j<n;j++){
				if(interval[i].end>interval[j].start){
					cnt++;
				}
			}
			ans=max(ans,cnt);
		}
		
		cout<<ans<<endl;
	}
}

C++: #include<iostream>

using namespace std;

typedef struct{
	int start,end;
	bool labelFlag;
}jikan;

int jikanShori(int h,int m,int s){
	return h*3600+m*60+s;
}

int main(){
	int n,cnt;
	int h,m,s;
	jikan interval[10000];
	
	for(int i=0;i<10000;i++){
		interval[i].start=0;
		interval[i].end=0;
		interval[i].labelFlag=false;
	}
	while(cin>>n,n){
		cnt=1;
		for(int i=0;i<10000;i++){
			interval[i].start=0;
			interval[i].end=0;
		}
		
		for(int i=0;i<n;i++){
			scanf("%d:%d:%d",&h,&m,&s);
			interval[i].start=jikanShori(h,m,s);
			scanf("%d:%d:%d",&h,&m,&s);
			interval[i].end=jikanShori(h,m,s);
		}
		
		for(int i=0;i<n;i++){
			if(!interval[i].labelFlag){
				interval[i].labelFlag=true;
				for(int j=i+1;j<n;j++){
					if(interval[i].end>interval[j].start && 
									!interval[j].labelFlag){
						cnt++;
						interval[j].labelFlag=true;
					}
				}
			}
		}
		
		cout<<cnt<<endl;
	}
}

C++: #include<bits/stdc++.h>
#define INF 2000000000
#define int long long int
#define MOD 1000000007
#define pb push_back
#define cin1(n) (cin >> n)
#define cin2(a,b) (cin >> a >> b)
#define cin3(a,b,c) (cin >> a >> b >> c)
#define cout(n) (cout << n << endl)
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define fr first 
#define sc second 
#define EPS (1e-10)

using namespace std;

typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef vector<pair<int,int>> vpii;
typedef vector<string> vs;
typedef vector<vector<string>> vss;
typedef pair<int,int> pii;

int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int n,m;
int a,b;
int p,q;

pii input(string t1,string t2) {
	int ret1,ret2;

	ret1 = stoi(t1.substr(6,2)) + 60 * stoi(t1.substr(3,2)) + 60 * 60 * stoi(t1.substr(0,2));
	ret2 = stoi(t2.substr(6,2)) + 60 * stoi(t2.substr(3,2)) + 60 * 60 * stoi(t2.substr(0,2));
	return make_pair(ret1,ret2);
}

signed main() {

	while(1) {
		cin1(n);
		if (n == 0) break;

		vpii table(n,make_pair(0,0));
		rep(i,0,n) {
			string time1,time2;
			cin2(time1,time2);
			table[i] = input(time1,time2);	
			//cout << table[i].fr << " " << table[i].sc << endl;
		}

		sort(table.begin(),table.end());
		
		int idx = 0;
		vector<pair<bool,int>> train;
		train.pb(make_pair(true,0));
		rep(i,0,60*60*24) {
			//std::cout << "table.fr " << table[idx].fr <<  std::endl;
			rep(j,0,train.size()) {
				if (train[j].sc == i) {
					//cout << "j = " << j << endl;
					//cout << "i = " << i << endl;
					train[j].fr = true;
					train[j].sc = 0;
				}
			}
			if (table[idx].fr == i) {
				//cout << "idx = " << idx << endl;
				//cout << "i = " << i << endl;
				//cout(table[idx].fr);
				bool flag = false;
				rep(j,0,train.size()) {
					if (train[j].fr) {
						train[j].fr = false;
						train[j].sc = table[idx].sc;
						flag = true;
						break;
					}
				}
				if (!flag) {
					train.pb(make_pair(false,table[idx].sc));
				}
				idx++;
				i--;
			}
		}
		cout(train.size());
	}

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
//#include <stack>
//#include <queue>
//#include <map>
#include <cmath>
//#include <string>
//#include <sstream>
#include <iomanip>
//#include <complex>
#include <stdio.h>
//小数制度 	cout << fixed << setprecision(5) << tmp << endl;
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)

int st[10001];
int en[10001];
vector < pair <int , int > > v;
int main(){
 int n;
  while(cin >> n,n){
  	int h,m,s;
  	REP(i,n){
	  	scanf("%d:%d:%d",&h,&m,&s);
  		v.push_back(make_pair(h*3600+m*60+s,1));
	  	scanf("%d:%d:%d",&h,&m,&s);
  		v.push_back(make_pair(h*3600+m*60+s,-1));
  	}
  	sort(All(v));
  	int res , ans ;
    res = ans = 0;
    for(int i = 0 ; i < v.size();++i){
      res += v[i].second;
      ans = max(ans,res);
    }
    printf("%d\n",ans);
  }
  return 0;
}