305_A. Strange Addition
Unfortunately, Vasya can only sum pairs of integers (a, b), such that for any decimal place at least one number has digit 0 in this place. For example, Vasya can sum numbers 505 and 50, but he cannot sum 1 and 4.

Vasya has a set of k distinct non-negative integers d1, d2, ..., dk.

Vasya wants to choose some integers from this set so that he could sum any two chosen numbers. What maximal number of integers can he choose in the required manner?

Input

The first input line contains integer k (1 ≤ k ≤ 100) — the number of integers.

The second line contains k distinct space-separated integers d1, d2, ..., dk (0 ≤ di ≤ 100).

Output

In the first line print a single integer n the maximum number of the chosen integers. In the second line print n distinct non-negative integers — the required integers.

If there are multiple solutions, print any of them. You can print the numbers in any order.

Examples

Input

4
100 10 1 0


Output

4
0 1 10 100 

Input

3
2 70 3


Output

2
2 70 
```python
n = int(input())
arr = list(map(int,input().split()))
t = []
flag = 0
if(0 in arr):
    t.append(0)
if(100 in arr):
    t.append(100)
for i in range(n):
    if(arr[i]>0 and arr[i]<10):
        t.append(arr[i])
        flag = 1
        break
for i in range(n):
    if(arr[i]%10 == 0 and arr[i]>0 and arr[i]<100):
        t.append(arr[i])
        flag = 1
        break
if(flag==0):
    for i in range(n):
        if(arr[i]>10 and arr[i]<100):
            t.append(arr[i])
            break
print(len(t))
for i in range(len(t)):
    print(t[i],end = " ")
```