Meeting Overlap Checker

Given \(N\) meetings, each defined by their start and end times, determine if any two meetings overlap. Two meetings \([a, b]\) and \([c, d]\) are said to overlap if \(b > c\) when the meetings are sorted by their start times. Note that if the end time of one meeting is equal to the start time of the next meeting (i.e. \(b = c\)), they are considered non-overlapping.

Your task is to read the meeting times from standard input, determine if any meeting overlaps with another, and output "Overlap" if an overlap exists or "No Overlap" otherwise.

inputFormat

The first line contains an integer \(N\), representing the number of meetings. Each of the next \(N\) lines contains two space-separated integers representing the start time and end time of a meeting.

outputFormat

Output a single line containing either "Overlap" if any two meetings overlap, or "No Overlap" if none of the meetings overlap.

3
1 3
2 5
6 8

Overlap