19162번 - Twin Buildings 다국어

As you might already know, space has always been a problem in ICPC Jakarta. To cope with this, ICPC Jakarta is planning to build two new buildings. These buildings should have a shape of a rectangle of the same size. Now, their problem is to find land to build the buildings.

There are N lands available for sale. The i^th land has a rectangular shape of size L_i × W_i. For a good feng shui, the building’s side should be parallel to the land’s sides.

One way is to build the two buildings on two different lands, one on each land (not necessarily with the same orientation). A building of size A × B can be build on the i^th land if and only if at least one of the following is satisfied:

• A ≤ L_i and B ≤ W_i, or
• A ≤ W_i and B ≤ L_i.

Alternatively, it is also possible to build two buildings of A × B on the i^th land with the same orientation. Formally, it is possible to build two buildings of A×B on the i^th land if and only if at least one of the following is satisfied:

• A × 2 ≤ L_i and B ≤ W_i, or
• A × 2 ≤ W_i and B ≤ L_i, or
• A ≤ L_i and B × 2 ≤ W_i, or
• A ≤ W_i and B × 2 ≤ L_i.

Your task in this problem is to help ICPC Jakarta to figure out the largest possible buildings they can build given N available lands. Note that ICPC Jakarta has to build two buildings of A × B; output the largest possible for A × B.

Input begins with a line containing an integer: N (1 ≤ N ≤ 100 000) representing the number of available lands. The next N lines each contains two integers: L_i W_i (1 ≤ L_i, W_i ≤ 10⁹) representing the size of the land.

Output in a line a number representing the largest building that ICPC Jakarta can build with exactly one decimal point (see sample input/output for clarity).