Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since 2001 (the year of its founding) till now. Petya knows that in 2001 the company income amounted to *a*<sub class="lower-index">1</sub> billion bourles, in 2002 — to *a*<sub class="lower-index">2</sub> billion, ..., and in the current (2000 + *n*)-th year — *a*<sub class="lower-index">*n*</sub> billion bourles. On the base of the information Petya decided to show in his presentation the linear progress history which is in his opinion perfect. According to a graph Petya has already made, in the first year BerSoft company income must amount to 1 billion bourles, in the second year — 2 billion bourles etc., each following year the income increases by 1 billion bourles. Unfortunately, the real numbers are different from the perfect ones. Among the numbers *a*<sub class="lower-index">*i*</sub> can even occur negative ones that are a sign of the company’s losses in some years. That is why Petya wants to ignore some data, in other words, cross some numbers *a*<sub class="lower-index">*i*</sub> from the sequence and leave only some subsequence that has perfect growth.

Thus Petya has to choose a sequence of years *y*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">2</sub>, ..., *y*<sub class="lower-index">*k*</sub>,so that in the year *y*<sub class="lower-index">1</sub> the company income amounted to 1 billion bourles, in the year *y*<sub class="lower-index">2</sub> — 2 billion bourles etc., in accordance with the perfect growth dynamics. Help him to choose the longest such sequence.
The first line contains an integer *n* (1 ≤ *n* ≤ 100). The next line contains *n* integers *a*<sub class="lower-index">*i*</sub> ( - 100 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 100). The number *a*<sub class="lower-index">*i*</sub> determines the income of BerSoft company in the (2000 + *i*)-th year. The numbers in the line are separated by spaces.
import sys

arr_size = sys.stdin.readline()

while arr_size:
    arr_size = int(arr_size)
    #print('arr_size', arr_size)
    array = sys.stdin.readline().split()
    #print('array', array)

    array = list(map(int, array))
    #print(array)

    
    
    years = [2000 + i + 1 for i in range(len(array))]
    #print(years)
    """
    ids_ommit = [i for i in range(1, len(array)) if  array[i-1] != array[i]-1 ]
    ids_ommit_neg = [i for i in range(len(array)) if  array[i] <0 ]
    print(ids_ommit)
    print(ids_ommit_neg)
    """    
    #ids_ommit = []
    last_number = 0
    ids_to_choose = []

    for i in range(len(array)):
        if array[i] > 0:
            if array[i]-1 != last_number:
                next
            else:
                ids_to_choose.append(i)
                last_number = array[i]
        else:
            next
            #ids_ommit.append(i)

    #print(ids_to_choose)
    #print(ids_ommit)


    if(len(ids_to_choose) > 0):
        print(len(ids_to_choose))
        str_arr = list(map(str, [years[i] for i in ids_to_choose]))
        #print(str_arr)
        print(' '.join(str_arr))
        #print(' '.join([years[i] for i in ids_to_choose]))
    else:
        print('0')



    #for i in range(len(array)):
    #    if array[i] > 0:
    #print("-----")
    arr_size = sys.stdin.readline()

