Consecutive Subsequence

Problem Description

Given an array $a_1, a_2, \dots, a_n$ of length $n$, find the longest consecutive increasing subsequence. That is, we want to find a subsequence $p_1, p_2, \dots, p_m$ satisfying $1 \le p_1 < p_2 < \dots < p_m \le n$ and $a_{p_m} - a_{p_{m-1}} = a_{p_{m-1}} - a_{p_{m-2}} = \dots = a_{p_2} - a_{p_1} = 1$. Output the maximum $m$ and the answer subsequence with the smallest lexicographic order.

Input Format

The first line contains an integer $n$.

The next line contains $n$ integers $a_1, a_2, \dots, a_n$.

Output Format

The first line contains an integer $m$, the length of the answer subsequence.

The second line contains $m$ integers, the answer subsequence.

Sample Input

7
3 3 4 7 5 6 8

Sample Output

4
3 4 5 6

Constraints

All data guarantee $1 \le n \le 200000$, $1 \le a_i \le 10^9$.