#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int MIN = -1e9, MAX = 1e9, MOD = 1e9 + 7;
void yes() {
  cout << "YES\n";
  return;
}
void no() {
  cout << "NO\n";
  return;
}
void out(long long int n) {
  cout << n << endl;
  return;
}
void outs(string str) {
  cout << str << endl;
  return;
}
void init() {}
void solve(int case_no) {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  vector<int> ans;
  bool ck[3] = {false};
  bool idk = false;
  for (int i = 0; i < n; i++) {
    if (a[i] == 0 && !idk) {
      ans.push_back(a[i]);
      idk = true;
    } else if (a[i] == 100 && !ck[2]) {
      ans.push_back(a[i]);
      ck[2] = true;
    } else {
      if (a[i] < 10 && !ck[0]) {
        ans.push_back(a[i]);
        ck[0] = true;
      } else if (a[i] % 10 == 0 && !ck[1]) {
        ans.push_back(a[i]);
        ck[1] = true;
      }
    }
  }
  if (!ck[0] && !ck[1]) {
    for (int i = 0; i < n; i++) {
      if (0 < a[i] && a[i] < 100) {
        ans.push_back(a[i]);
        break;
      }
    }
  }
  out(ans.size());
  for (int i : ans) cout << i << ' ';
  cout << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  srand(time(NULL));
  init();
  int t = 1;
  for (int i = 1; i <= t; i++) solve(i);
}
