#include <bits/stdc++.h>
using namespace std;
long long modex(long long x, long long n) {
  if (n == 0)
    return 1;
  else if (!(n & 1))
    return modex((x * x) % 1000000007, n / 2);
  else
    return (x * modex((x * x) % 1000000007, (n - 1) / 2)) % 1000000007;
}
long long modinv(long long n) { return modex(n, 1000000007 - 2); }
void bfs(vector<int> g[], int s, int n) {
  queue<long long> q;
  bool vis[n];
  memset(vis, false, sizeof(vis));
  vis[s] = true;
  q.push(s);
  while (!q.empty()) {
    long long temp = q.front();
    q.pop();
    for (auto it : g[temp]) {
      if (vis[it] == false) {
        q.push(it);
        vis[it] = true;
      }
    }
  }
}
void dfs(vector<int> g[], int src, bool vis[]) {
  vis[src] = true;
  for (auto it : g[src]) {
    if (vis[it] == false) {
      dfs(g, it, vis);
    }
  }
}
int main() {
  long long t;
  t = 1;
  while (t--) {
    long long n;
    cin >> n;
    string s;
    cin >> s;
    long long e = 0, o = 0;
    for (long long i = 0; i < n; i++) {
      if (s[i] == '0')
        o++;
      else
        e++;
    }
    if (o != e) {
      cout << 1 << endl << s;
    } else {
      cout << 2 << endl << s.substr(0, n - 1) << " " << s[n - 1];
    }
  }
  return 0;
}
