#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
long int idx[100001];
long long int power(long long int x, long long int y, long long int z) {
  long long int res = 1;
  x %= z;
  while (y > 0) {
    if (y & 1) res = (res * x) % z;
    x = (x * x) % z;
    y /= 2;
  }
  return res;
}
long long int power1(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    x = (x * x);
    y /= 2;
  }
  return res;
}
long int root(long int x) {
  while (idx[x] != x) x = idx[x];
  return x;
}
void union1(long int x, long int y) { idx[root(x)] = root(y); }
int main() {
  long int n;
  cin >> n;
  string a;
  cin >> a;
  long int aa = 0, bb = 0;
  for (long int i = 0; i < n; i++) {
    if (a[i] == '0')
      aa++;
    else
      bb++;
  }
  if (aa == bb) {
    cout << "2" << endl;
    for (long int i = 0; i < n - 1; i++) cout << a[i];
    cout << " " << a[n - 1];
  } else {
    cout << "1" << endl;
    for (long int i = 0; i < n; i++) cout << a[i];
  }
}
