Staza
Marko and Dario go to school one day. They both use the same route, but they arrive at school at different times. Along the route there are several clocks, the last one is right in front of the school. Given the times Marko and Dario respectively see on the clocks as they pass them on their way, determine who arrives first at school that day.
InputOn the first line the number N, the number of clocks along the route.
Then N lines containing the times on the clocks as Marko sees them, in increasing order.Then N lines containing the times on the clocks as Dario sees them, in increasing order.All times are given in the format HH:MM (hour and minute, respectively, in two digit format).
Then N lines containing the times on the clocks as Marko sees them, in increasing order.Then N lines containing the times on the clocks as Dario sees them, in increasing order.All times are given in the format HH:MM (hour and minute, respectively, in two digit format).
OutputOne line, containing the name of the guy who arrives at school first, "Marko" or "Dario".
Input
Output
3
10:25
10:35
10:45
08:00
08:05
08:10Output
DarioSubmit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.