Triangle

There are $N$ sticks. The length of the $i$-th stick is $a\_i$. You want to choose six sticks and construct two triangles. Each stick should be used as an edge of one of the triangles. Also, the triangles should be non-degenerate.

Compute the maximum possible total length of the six chosen sticks. If two triangles can not be constructed this way, assume the total length is 0.

The first line contains an integer $N$ ($1 \le N \le 10^5$). The $i$-th of the next $N$ lines contains an integer $a\_i$ ($1 \le a\_i \le 10^{15}$).

Print the answer.