\(3^{rd}\) round, December \(7^{th}\), 2013

Melita has just returned from the annual pig slaughter. Don't worry, this is a regular thing in Croatia.
The best part was the abundance of food! There was everything, starting from good spicy sausages,
ham, black pudding, up to teewurst, top quality bacon and čvarci, all with warm white bread and butter.
After these appetizers, it was the perfect time to whip up a deep pot full of sarma (Melita ate twentyish
of them) as well as a large platter of fine roast pork, so soft that it almost melts in your mouth. They
watered all of this down with copious gulps of the best dry white wine that made them even hungrier.
Butcher Bajs kept his awa\(rd-wi\)nning ham for the very end. N people attented the annual pig slaughter,
labeled with numbers from 1 to N. These people already ate a lot of meat: the k^{th} person ate A[k]
kilograms of meat so far. Bajs will distribute his ham to the people in the ratio B[1] : B[2] : ... : B[N],
exactly in that order, but he doesn't know the total amount (number of kilos) of ham which he will be
distributing yet.
At the end of the slaughter, the Man of the Year will be declared. A ranking list is made according to
the total kilos of meat eaten. Bajs impacts directly on this list by choosing the amount of ham to
distribute. Although Bajs has been offered bribes many times, he refused each time, saying that he was
an honest man who would not hurt a fly.
Bajs cares about order, because he's a nice gentleman, and wants to have the order of people in the
exact form of 1, 2, 3, ..., N, respectively from the one who ate the most kilos of meat to those who ate
less, allowing ties between participants. Help Bajs select the total amount of ham that he will distribute
(in the ratio mentioned before) to achieve his intention.

The first line of input contains an integer N (\(2 \le N \le 1000\)), the number of competitors for the Man
of the Year award.
Each of the following k lines contains integers A[k] i B[k], as mentioned in the text (\(0 \le A\)[k], B[k] ≤
\(10^{6}\)). At least one of the numbers B[k] will not be equal to 0.

The first and only line of output must conta\(in -1\) if the required order cannot be achieved. Otherwise,
output the required amount of ham in kilos, a real number (rounded up to 12 decimal places) between
0 and \(10^{7}\) (inclusive). If there are multiple possible solutions, output any.

생성자가 기록되지 않았습니다.

출처 COCI 2013/2014 Contest 3