You are given a sequence of positive integers a 1 , a 2 , ..., a n . While possible, you perform the following operation: find a pair of equal consecutive elements. If there are more than one such pair, find the leftmost (with the smallest indices of elements). If the two integers are equal to x , delete both and insert a single integer x + 1 on their place. This way the number of elements in the sequence is decreased by 1 on each step. You stop performing the operation when there is no pair of equal consecutive elements. For example, if the initial sequence is 5, 2, 1, 1, 2, 2 , then after the first operation you get 5, 2, 2, 2, 2 , after the second — 5, 3, 2, 2 , after the third — 5, 3, 3 , and finally after the fourth you get 5, 4 . After that there are no equal consecutive elements left in the sequence, so you stop the process. Determine the final sequence after you stop performing the operation. The first line contains a single integer n ( 2 ≤ n ≤ 2·10 5 ) — the number of elements in the sequence. The second line contains the sequence of integers a 1 , a 2 , ..., a n ( 1 ≤ a i ≤ 10 9 ). In the first line print a single integer k — the number of elements in the sequence after you stop performing the operation. In the second line print k integers — the sequence after you stop performing the operation. The first example is described in the statements. In the second example the initial sequence is 1000000000, 1000000000, 1000000000, 1000000000 . After the first operation the sequence is equal to 1000000001, 1000000000, 1000000000 . After the second operation the sequence is 1000000001, 1000000001 . After the third operation the sequence is 1000000002 . In the third example there are no two equal consecutive elements initially, so the sequence does not change.