Meeting Room Scheduler

You are given a list of meeting intervals. Each meeting is represented as a pair of integers \(s\) and \(e\) denoting the start and end times respectively. Two meetings are considered non-overlapping if the start time of a meeting is not less than the end time of the previous meeting. In other words, for sorted intervals \((s_1, e_1), (s_2, e_2), \dots, (s_n, e_n)\), the condition \(s_{i+1} \ge e_i\) must hold for all \(1 \le i < n\).

Your task is to determine whether a person can attend all the meetings without any time conflicts. Note that if one meeting ends exactly when another begins, they do not overlap.

inputFormat

The input is read from standard input (stdin). The first line contains a single integer \(n\), representing the number of meetings. Each of the next \(n\) lines contains two space-separated integers \(s\) and \(e\), which denote the start and end times of a meeting.

outputFormat

Output a single line to standard output (stdout) with either "True" if the person can attend all meetings without any overlap, or "False" otherwise.

0

True