Array Endpoints

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

You are given an integer array $a$ of length $n$ with $n \ge 1$, indexed from $0$ to $n-1$. The first element is $a_0$ and the last element is $a_{n-1}$. Print these two values in that order.

Input

• The first line contains the integer $n$, the number of array elements.
• The second line contains exactly $n$ integers $a_0,a_1,\ldots,a_{n-1}$ in increasing index order.

Output

Print the two integers $a_0$ and $a_{n-1}$, separated by one space.

Subtasks

Subtask 1 (20 points): $n=1$, $-9 \le a_0 \le 9$.

Subtask 2 (30 points): $2 \le n \le 20$, $0 \le a_i \le 10^4$ for every $0 \le i<n$.

Subtask 3 (50 points): $1 \le n \le 1000$, $-10^9 \le a_i \le 10^9$ for every $0 \le i<n$.

Examples

Input

5
8 6 7 5 3

Output

8 3

Explanation

The first element is $a_0=8$. The last index is $n-1=4$ and the last value is $3$. Therefore the output is 8 3.