#include <bits/stdc++.h>
using namespace std;
int i, i0, n, m, a[105];
bool vis[100];
vector<int> ans;
int main() {
  while (scanf("%d", &n) != EOF) {
    for (i = 0; i < n; i++) scanf("%d", &a[i]);
    sort(a, a + n);
    for (i = 0; i < n; i++) {
      if (a[i] == 0) {
        ans.push_back(a[i]);
        vis[0] = 1;
        break;
      }
    }
    for (i = 0; i < n; i++) {
      if (a[i] < 10 && a[i] != 0) {
        ans.push_back(a[i]);
        vis[1] = 1;
        break;
      }
    }
    for (i = 0; i < n; i++) {
      if (a[i] < 100 && a[i] % 10 == 0 && a[i] >= 10) {
        ans.push_back(a[i]);
        vis[2] = 1;
        break;
      }
    }
    for (i = 0; i < n; i++) {
      if (a[i] == 100) {
        ans.push_back(a[i]);
        vis[3] = 1;
        break;
      }
    }
    if (vis[1] == 0 && vis[2] == 0) {
      for (i = 0; i < n; i++)
        if (a[i] < 100 && a[i] >= 10) {
          ans.push_back(a[i]);
          break;
        }
    }
    printf("%d\n", ans.size());
    for (i = 0; i < ans.size(); i++) {
      printf("%d", ans[i]);
      if (ans.size() - 1 == i)
        printf("\n");
      else
        printf(" ");
    }
  }
  return 0;
}
