#include <bits/stdc++.h>
using namespace std;
int n,dp[100010],x[100010],stk[100010][2],top = 0; char s[100010];
int main() {
	scanf("%d%s",&n,s+1); dp[0] = 0;
	for(int i = 1; i <= n; i++) {
		dp[i] = dp[i-1]+1; x[i] = 1;
		if(i >= 2) {
			if(s[i] == s[i-1] && (s[i]=='M'||s[i]=='C'||s[i]=='X'||s[i]=='I')) {
				if(dp[i-2]+1 < dp[i]) x[i] = 2,dp[i] = dp[i-2]+1; 
			}
		}
		if(i >= 3) {
			bool ok = false;
			ok |= (s[i-2]=='M'&&s[i-1]=='C'&&s[i]=='M');
			ok |= (s[i-2]=='C'&&s[i-1]=='X'&&s[i]=='C');
			ok |= (s[i-2]=='X'&&s[i-1]=='I'&&s[i]=='X');
			if(ok) {
				if(dp[i-3]+1 < dp[i]) x[i] = 3,dp[i] = dp[i-3]+1; 
			}
		}
	}
	int cur = n;
	while(cur) {
		stk[++top][0] = cur; stk[top][1] = x[cur];
		cur -= x[cur];
	}
	printf("%d\n",top);
	for(int i = top; i >= 1; i--) {
		for(int j = stk[i][0]-stk[i][1]+1; j <= stk[i][0]; j++) putchar(s[j]); putchar('\n');
	}
	return 0;
}