import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

class TimeSet implements Comparable<TimeSet> {
	Time start;
	Time end;

	public TimeSet(String st) throws NumberFormatException, Exception
	{
		int posSemiColon1 = st.indexOf(":");
		int posSemiColon2 = st.indexOf(":",posSemiColon1+1);

		this.start = new Time(Integer.parseInt(st.substring(0, posSemiColon1)), Integer.parseInt(st.substring(posSemiColon1+1, posSemiColon1+3)));
		this.end = new Time(Integer.parseInt(st.substring(posSemiColon2-2, posSemiColon2)), Integer.parseInt(st.substring(posSemiColon2+1, posSemiColon2+3)) );

		if (start.hour > end.hour)
			throw new Exception("End time have to be after start time");
		else if (start.hour == end.hour && start.min > end.min)
			throw new Exception("End time have to be after start time");
	}

	class Time {
		int hour;
		int min;

		public Time(int hour, int min) throws Exception {
			super();
			this.hour = hour;
			this.min = min;
			if (hour < 0 || hour > 23)
				throw new Exception("Hour out of Range");
			if (min < 0 || min > 59)
				throw new Exception("Min out of Range");
		}
	}

	@Override
	public int compareTo(TimeSet o) {
		// TODO Auto-generated method stub
		if (this.start.hour != o.start.hour)
			return this.start.hour - o.start.hour;
		return this.start.min - o.start.min;
	}

	@Override
	public String toString() {
		return start.hour + ":" + start.min + " - " + end.hour + ":" + end.min;
	}
}

public class Solver {

	public static void timeMerger(List<TimeSet> timeHolder) throws Exception {
		for (int i = 0; i < timeHolder.size() - 1; i++) {
			TimeSet present = timeHolder.get(i);
			TimeSet next = timeHolder.get(i + 1);

			if (present.end.hour > next.start.hour
					|| (present.end.hour == next.start.hour && present.end.min >= next.start.min)) {
				timeHolder.remove(i + 1);
				timeHolder.remove(i);
				TimeSet merged = new TimeSet(present.start.hour, present.start.min, next.end.hour, next.end.min);
				timeHolder.add(i, merged);
				i--;
			}
		}
	}

	public static TimeSet ScanningInput(List<TimeSet> timeHolder) throws Exception {
		Scanner sc = new Scanner(System.in);

		int howMany = Integer.parseInt(sc.nextLine());
		while (howMany > 0) {

			TimeSet t = new TimeSet(sc.nextLine());
			timeHolder.add(t);
			howMany--;
		}

		TimeSet toBeTested = new TimeSet(sc.nextLine());
		return toBeTested;
	}

	public static boolean isTransactionValid(TimeSet toBeTested,List<TimeSet> timeHolder) {

		for (int i = 0; i < timeHolder.size(); i++) {
			TimeSet present = timeHolder.get(i);
			if( (present.start.hour<toBeTested.start.hour || (present.start.hour == toBeTested.start.hour && present.start.min <= toBeTested.start.min)) 
					&& (present.end.hour>toBeTested.end.hour || (present.end.hour == toBeTested.end.hour && present.end.min >= toBeTested.end.min)) )
				return true;
		}
		return false;
	}

	public static void main(String[] args) throws Exception {

		List<TimeSet> timeHolder = new ArrayList<>();
		TimeSet toBeTested = ScanningInput(timeHolder);

		System.out.println("TimeSet Collection in the order timesets have been added");
		System.out.println(timeHolder);

		//sorting it 
		Collections.sort(timeHolder);
		System.out.println("TimeSet Collection After Sorting based on start time");
		System.out.println(timeHolder);

		//merging it 
		timeMerger(timeHolder);
		System.out.println("TimeSet Collection After Merging");
		System.out.println(timeHolder);

		System.out.println(isTransactionValid(toBeTested,timeHolder));
	}
}

/*
 Time complexity O(n(log(n))) 
 Sorting takes O(n(log(n)). All other operations are done in O(n) time.


 Input format 
 1st line defines number of time stamp available for banks to be operated 
 2nd to 2nd last lines contain all the time stamp availablity of banks
 Last line is the test to be checked.


Test case - For 4 entries of time stamp , the last one to be tested

4
04:20 - 12:30
19:00 - 21:45
14:00 - 17:30
12:30 - 14:00
16:00 - 17:30

 */