Meeting Scheduler

You are given a list of meeting time intervals represented as pairs of integers (start, end). Determine if a person can attend all meetings without any overlaps. Two meetings are considered non-overlapping if the end time of one meeting is less than or equal to the start time of the next meeting, i.e., if for meetings (a, b) and (c, d), the condition (b \leq c) holds. Otherwise, if any meeting overlaps with another, it is not possible to attend all meetings. Solve this problem by processing input from STDIN and printing the result to STDOUT.

inputFormat

The first line contains an integer (n), representing the number of meetings. This is followed by (n) lines, each containing two space-separated integers representing the start time and the end time of a meeting.

outputFormat

Output "True" (without quotes) if a person can attend all the meetings without any overlaps; otherwise, output "False". The output should be printed to STDOUT.## sample

0

True