Problem Description

There are signboards around Kyoto University.

Hearing rumors that these signboards are destroying Kyoto's traditional landscape, you decided to verify whether these rumors are true.

There are $ N $ signboards numbered from $ 1 $ to $ N $ around the university. The signboard $ i $ has an area of $ s_i $ and a flashiness of $ a_i $.

The landscape destruction index of the signboard $ i $ is given by $s_i \times a_i$.

Output the maximum value among the landscape destruction indices of the $ N $ signboards.

Input Format

The input is given from the standard input in the following format:

$ N $ $ s_1 $ $ s_2 $ $ ... $ $ s_N $ $ a_1 $ $ a_2 $ $ ... $ $ a_N $

Output Format

Output the maximum value among the landscape destruction indices of the $ N $ signboards.

Sample Input and Output

Sample Input #1

3
3 2 1
3 3 4

Sample Output #1

9

Sample Input #2

1
1
1

Sample Output #2

1

Notes/Hints

Constraints

• $1 \leq N \leq 100$
• $1 \leq s_i \leq 100$ $(1 \leq i \leq N)$
• $1 \leq a_i \leq 100$ $(1 \leq i \leq N)$
• All inputs are integers.

Sample Explanation 1

The landscape destruction indices of each signboard are $ 9, 6, 4 $, and the maximum among them is $ 9 $.

见题面 Input 部分

见题面 Output 部分