Govnocode

#define _CRT_SECURE_NO_WARNINGS
//#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <deque>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <utility>
#include <algorithm>
#include <tuple>
#include <iostream>
#include <random>
#include <iterator>
#include <list>
#include <iomanip>
#include <random>
#include <complex>
#include <deque>
#include <numeric>

using namespace std;

#define ACCEPTED return 0;
#define pause system("pause")
#define optimize ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define mas(x) (x), (x) + n
#define sz(x) (x).size()
#define sc(x) scanf("%d", &(x))
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define scnaf scanf
#define scafn scanf
#define fn(x, y) for(int (x) = 0; (x) < (y); (x)++)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef stack<int> si;
typedef queue<int> aye;
typedef vector<bool> vb;
typedef vector<pii> vpii;
typedef vector<ll> vll;

const int maxn = 500;
const double eps = 1e-7;
const ld pi = 3.14159265358979323846;
const ld e = 2.71828182845904523536;
const ll inf = (ll)1e18;
const int mod = (int)1e9 + 7;
const ll modulo = 998244353;
//------------------------------------

void solve()
{
    int n;
    cin >> n;
    string s;
    cin >> s;

    int O = 0, I = 0;

    for (int i = 0; i < n; i++)
    {
        switch (s[i])
        {
        case '0':
            O++;
            break;
        case '1':
            I++;
            break;
        }
    }

    if (O != I)
    {
        cout << 1 << "\n" << s;
    }
    else
    {
        cout << 2 << "\n";

        for (int l = 1; l < n; l++)
        {
            for (int i = 0; i < n; i++)
            {
                int s1_i = 0, s1_o = 0, s2_i = 0, s2_o = 0;
                for (int f = 0; f < l; f++)
                {
                    switch (s[f])
                    {
                    case '0':
                        s1_o++;
                        break;
                    case '1':
                        s1_i++;
                        break;
                    }
                }

                for (int f = l; f < n; f++)
                {
                    switch (s[f])
                    {
                    case '0':
                        s2_o++;
                        break;
                    case '1':
                        s2_i++;
                        break;
                    }
                }

                if (s1_i != s1_o && s2_i != s2_o)
                {
                    cout << s.substr(0, l) << " " << s.substr(l, n - l);
                    return;
                }
            }
        }
    }
}

int main()
{
    optimize;

#ifdef _DEBUG
    auto input = freopen("input.txt", "r", stdin);
    auto output = freopen("output.txt", "w", stdout);
#else
    //auto input = freopen("condense2.in", "r", stdin);
    //auto output = freopen("condense2.out", "w", stdout);
#endif

    solve();

    ACCEPTED
}

/* Sun Feb 23 2020 12:22:43 GMT+0300 (MSK) */