Little girl Tanya climbs the stairs inside a multi-storey building. Every time Tanya climbs a stairway, she starts counting steps from $1$ to the number of steps in this stairway. She speaks every number aloud. For example, if she climbs two stairways, the first of which contains $3$ steps, and the second contains $4$ steps, she will pronounce the numbers $1, 2, 3, 1, 2, 3, 4$.

You are given all the numbers pronounced by Tanya. How many stairways did she climb? Also, output the number of steps in each stairway.

The given sequence will be a valid sequence that Tanya could have pronounced when climbing one or more stairways.
The first line contains $n$ ($1 \le n \le 1000$) — the total number of numbers pronounced by Tanya.

The second line contains integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 1000$) — all the numbers Tanya pronounced while climbing the stairs, in order from the first to the last pronounced number. Passing a stairway with $x$ steps, she will pronounce the numbers $1, 2, \dots, x$ in that order.

The given sequence will be a valid sequence that Tanya could have pronounced when climbing one or more stairways.
7
1 2 3 1 2 3 4
2
3 4 
4
1 1 1 1
4
1 1 1 1 
5
1 2 3 4 5
1
5 
5
1 2 1 2 1
3
2 2 1 
1
1
1
1 
48
1 2 3 4 1 2 3 1 1 2 3 1 2 3 4 1 1 2 3 4 1 2 3 4 1 2 3 4 1 1 2 1 2 1 2 1 1 2 1 2 1 2 3 1 2 1 2 1
20
4 3 1 3 4 1 4 4 4 1 2 2 2 1 2 2 3 2 2 1 
2
1 2
1
2 
3
1 1 2
2
1 2 
4
1 1 2 3
2
1 3 
8
1 2 3 1 2 3 4 5
2
3 5 
5
1 1 1 2 3
3
1 1 3 
#sa7afy
#a,b = map(int,input().split())
#arr=[]
#arr=list(map(int,input().split()))
#arr = list(dict.fromkeys(arr))
#arr.sort()
#n = int(input())
#for i in range():
#print(*list)
#sorted(arr, reverse=True)
 
#def isPalindrome(s):
    #return s == s[::-1]
#min(n*a,-n//m*-b,n//m*b+n%m*a),max(n*a,-n//m*-b,n//m*b+n%m*a)
#import re
#x=input()
#z=re.search(r"text",x)
#n=str(sum(map(int,n)))  

 
#────────▓▓▓▓▓▓▓────────────▒▒▒▒▒▒
#──────▓▓▒▒▒▒▒▒▒▓▓────────▒▒░░░░░░▒▒
#────▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓────▒▒░░░░░░░░░▒▒▒
#───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒░░░░░░░░░░░░░░▒
#──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒
#──▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒
#─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░░▒
#▓▓▒▒▒▒▒▒░░░░░░░░░░░▒▒░░▒▒▒▒▒▒▒▒▒▒▒░░░░░░▒
#▓▓▒▒▒▒▒▒▀▀▀▀▀███▄▄▒▒▒░░░▄▄▄██▀▀▀▀▀░░░░░░▒
#▓▓▒▒▒▒▒▒▒▄▀████▀███▄▒░▄████▀████▄░░░░░░░▒
#▓▓▒▒▒▒▒▒█──▀█████▀─▌▒░▐──▀█████▀─█░░░░░░▒
#▓▓▒▒▒▒▒▒▒▀▄▄▄▄▄▄▄▄▀▒▒░░▀▄▄▄▄▄▄▄▄▀░░░░░░░▒
#─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒
#──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒
#───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀▀▀░░░░░░░░░░░░░░▒
#────▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░▒▒
#─────▓▓▒▒▒▒▒▒▒▒▒▒▄▄▄▄▄▄▄▄▄░░░░░░░░▒▒
#──────▓▓▒▒▒▒▒▒▒▄▀▀▀▀▀▀▀▀▀▀▀▄░░░░░▒▒
#───────▓▓▒▒▒▒▒▀▒▒▒▒▒▒░░░░░░░▀░░░▒▒
#────────▓▓▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░▒▒
#──────────▓▓▒▒▒▒▒▒▒▒▒░░░░░░░░▒▒
#───────────▓▓▒▒▒▒▒▒▒▒░░░░░░░▒▒
#─────────────▓▓▒▒▒▒▒▒░░░░░▒▒
#───────────────▓▓▒▒▒▒░░░░▒▒
#────────────────▓▓▒▒▒░░░▒▒
#──────────────────▓▓▒░▒▒
#───────────────────▓▒░▒
#────────────────────▓▒
 
 
 
import collections
import math
import sys
 


def run():
    print("YOusef")
def run3():
    print("Abdalla")    
def run2():
    print("Attia")
def kk():
    print("Sa7afy")    
#code here

n=int(input())
ans=[]
arr=list(map(int,input().split()))
print(arr.count(1))
for i in range(len(arr)-1):
    if arr[i+1]==1:
        ans.append(arr[i])
ans.append(arr[len(arr)-1])    
print(*ans)        
        