#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long SIZE = 100000;
const int INF = 0x3f3f3f3f;
const long long ll_INF = 0x3f3f3f3f3f3f3f3f;
const long double PI = acos(-1);
const long long MAXN = numeric_limits<long long>::max();
const long long MAX = 2000000;
bool isprime(long long n) {
  if (n <= 1) return false;
  for (long long i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return false;
  return true;
}
void disp(vector<long long> v) {
  for (auto u : v) cout << u << " ";
  cout << '\n';
}
void solve() {
  int n;
  cin >> n;
  int one = 0, zro = 0;
  string s;
  cin >> s;
  for (long long i = 0; i < n; i++) {
    if (s[i] == '1')
      one++;
    else
      zro++;
  }
  if (one != zro)
    cout << 1 << "\n" << s;
  else {
    cout << 2 << "\n";
    cout << s[0] << " ";
    s.erase(0, 1);
    cout << s;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
