#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream &operator<<(ostream &os, const vector<T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
  return os << "(" << p.first << "," << p.second << ")";
}
template <class T>
bool umin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool umax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
const long long N = 2e5 + 10;
void solve() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  if (count(s.begin(), s.end(), '0') == (n / 2) && n % 2 == 0) {
    cout << 2 << endl << s[0] << ' ' << s.substr(1) << endl;
  } else
    cout << "1\n" << s << endl;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  long long q = 1;
  while (q--) solve();
  return 0;
}
