#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, M = 3, nBits = 2e8 + 5, MM = (1 << 16), MAX = 1111,
          OO = 0x3f3f3f3f, MOD = 1000000007, inf = 1 << 30;
const double PI = acos(-1);
const long long INF = (long long)1e18, MOOD = 1000000007;
long long GCD(long long a, long long b) { return !b ? a : GCD(b, a % b); }
long long LCM(long long x, long long y) { return (x * y / GCD(x, y)); }
long long fact(long long z) { return (z <= 1) ? 1 : z * fact(z - 1); }
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
}
int t, q, n, m, c, d, x, y, z, a, b, cnt, A[N];
long long sum;
string second, ss;
deque<int> dq;
vector<int> v;
int main() {
  fast();
  cin >> n >> second;
  for (int i = 0; i < n; ++i)
    if (second[i] == '1')
      ++x;
    else
      ++y;
  if (x == y)
    cout << "2\n" << second[0] << " " << second.substr(1) << endl;
  else
    cout << "1\n" << second << endl;
  return 0;
}
