#include <bits/stdc++.h>
using namespace std;
const int MAXN = 8;
const int MAXR = 1;
const int MAXC = 1;
const int MAXBITS = 64;
const int INF = (int)1e9;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};
priority_queue<int, vector<int>, greater<int>> q1;
priority_queue<int, vector<int>, less<int>> q2;
void l() { ; }
int arr[] = {10, 20, 30, 40, 50, 60, 70, 80, 90};
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, x;
  cin >> n;
  vector<int> v, v2(n);
  bool oneAdded = false;
  bool otherAdded = false;
  int sz = sizeof(arr) / sizeof(arr[0]);
  set<int> s;
  for (int i = 0; i < sz; ++i) {
    s.insert(arr[i]);
  }
  for (int i = 0; i < n; ++i) {
    cin >> v2[i];
  }
  sort((v2).begin(), (v2).end());
  bool z, o, t, h;
  z = o = t = h = false;
  for (int i = 0; i < n; ++i) {
    x = v2[i];
    if (x == 0) {
      z = true;
      v.push_back(x);
    } else if (!o && x < 10 && x > 0) {
      o = true;
      v.push_back(x);
    } else if (x == 100) {
      h = true;
      v.push_back(x);
    } else if (s.find(x) != s.end() && !t) {
      t = true;
      v.push_back(x);
    }
  }
  if (!o && !t) {
    if (z && v2.size() > 1 && v2[1] != 100) {
      v.push_back(v2[1]);
    } else if (!z && v2[0] != 100) {
      v.push_back(v2[0]);
    }
  }
  cout << v.size() << "\n";
  for (auto it : v) {
    cout << it << " ";
  }
  return 0;
}
