Codeforces Global Round 13 |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

brute force

data structures

*3500

No tag edit access

The problem statement has recently been changed. View the changes.

×
I. Ruler Of The Zoo

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAfter realizing that Zookeeper is just a duck, the animals have overthrown Zookeeper. They now have to decide a new ruler among themselves through a fighting tournament of the following format:

Initially, animal $$$0$$$ is king, while everyone else queues up with animal $$$1$$$ at the front of the queue and animal $$$n-1$$$ at the back. The animal at the front of the queue will challenge the king to a fight, and the animal with greater strength will win the fight. The winner will become king, while the loser joins the back of the queue.

An animal who wins $$$3$$$ times consecutively will be crowned ruler for the whole zoo. The strength of each animal depends on how many consecutive fights he won. Animal $$$i$$$ has strength $$$A_i$$$ with $$$0$$$ consecutive win, $$$B_i$$$ with $$$1$$$ consecutive win, and $$$C_i$$$ with $$$2$$$ consecutive wins. Initially, everyone has $$$0$$$ consecutive win.

For all animals, $$$A_i > B_i$$$ and $$$C_i > B_i$$$. Also, the values of $$$A_i$$$, $$$B_i$$$, $$$C_i$$$ are distinct (all $$$3n$$$ values are pairwise different).

In other words, an animal who is not a king has strength $$$A_i$$$. A king usually has a strength of $$$B_i$$$ or $$$C_i$$$. The exception is on the first turn, the first king (animal $$$0$$$) has strength $$$A_i$$$.

Who is the new ruler, and after how many fights? Or will it end up that animals fight forever with no one ending up as ruler?

Input

The first line contains one integer $$$n$$$ ($$$4 \leq n \leq 6000$$$) — number of the animals.

$$$i$$$-th of the next $$$n$$$ lines contains $$$3$$$ integers $$$A_i$$$, $$$B_i$$$ and $$$C_i$$$ ($$$0 \leq A_i, B_i, C_i \leq 10^9$$$).

It is guaranteed that $$$A_i > B_i$$$ and $$$C_i > B_i$$$, and that all values of $$$A_i$$$, $$$B_i$$$ and $$$C_i$$$ are distinct.

Output

Output two integers in a single line. The first is the index of the animal that will become ruler, and the second is the number of fights passed until some animal becomes the ruler.

If the animals will fight for infinitely long, output -1 -1 instead.

Examples

Input

4 5 1 2 10 8 11 9 0 3 7 4 6

Output

-1 -1

Input

5 11 7 12 8 6 14 2 1 10 13 0 9 5 3 4

Output

1 7

Note

The following describes the sequence of events for the second sample. Note that in fight $$$1$$$, the king (animal $$$0$$$) has strength $$$A_0$$$. The tournament ends at fight $$$7$$$ as animal $$$1$$$ wins fight $$$5$$$, $$$6$$$ and $$$7$$$.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/22/2023 20:45:59 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|