Count the Read Elements

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

You are given a one-dimensional array containing exactly $n$ valid integers. The physical storage capacity may be larger, but the logical size is the number of elements actually read. Print that logical size.

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 one integer: the number of valid elements read, which is $n$.

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

6
4 8 15 16 23 42

Output

6

Explanation

The first line gives $n=6$, and the second line contains exactly six integers. Therefore the logical array size is $6$.