A robotics lab has exactly one shared charging dock for all of its robots. Two robots have each reserved a window of time to plug into that dock, given as a start time and an end time on the same 24-hour clock. Because the dock can only serve one robot at any given instant, you must determine whether the two robots' reservation windows conflict — that is, whether there is at least one minute that falls inside both windows.

Input format

• Line 1: two space-separated strings start1 end1 — the first robot's reservation window, each in 24-hour HH:MM format.
• Line 2: two space-separated strings start2 end2 — the second robot's reservation window, in the same format.

Output format

Print true if the two windows share at least one common minute, or false if they never overlap.

Constraints

• Each time string has the form HH:MM, with 00 <= HH <= 23 and 00 <= MM <= 59.
• For each robot, its start time is no later than its end time.
• A minute that is the end of one window and simultaneously the start of the other still counts as shared, so it counts as a conflict.

01:15 02:00
02:00 03:00

true

10:00 11:00
14:00 15:00

false