#include <iostream>
#include <vector>
using namespace std;
const int mn = 30;
const int block = 15;

int lef[1<<(block)], rig[1<<(mn-block)];
int n; 
int cost[1<<(block)][(mn-block)];
int adj[mn][mn];
bool inc[mn-block];
int main() {
	string s; cin >> s;
	n = s.size();

	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			cin >> adj[i][j];
			adj[j][i] = adj[i][j];
		}
	}

	int blockSz = min(n, 15);

	vector<int> gray = { 0 };
	for (int i = 1; i < n-blockSz; i++) {
		auto now = gray;
		now.pop_back();
		now.push_back(i);
		for (int j = 0; j < gray.size(); j++) now.push_back(gray[gray.size()-1-j]);
		now.push_back(i);
		gray = now;
	}

	for (int i = 0; i < (1<<blockSz); i++) {
		for (int j = 0; j < blockSz; j++) {
			if (!(i&(1<<j))) continue;
			for (int k = j; k < blockSz; k++) {
				if (i&(1<<k)) lef[i] += adj[j][k];
			}
		}
		for (int j = 0; j < blockSz; j++) {
			if ((i&(1<<j)) == 0) continue;
			for (int k = 0; k < n-blockSz; k++) {
				cost[i][k] += adj[j][k+blockSz];
			}
		}
	}

	for (int i = 0; i < (1<<(n-blockSz)); i++) {
		for (int j = 0; j < n-blockSz; j++) {
			if (!(i&(1<<j))) continue;
			for (int k = j; k < n-blockSz; k++) {
				if (i&(1<<k)) rig[i] += adj[j+blockSz][k+blockSz];
			}
		}
	}
	gray.pop_back();

	int out = 0;
	int bestBlock = 0, bestMask = 0;
	for (int i = 0; i < (1<<blockSz); i++) {
		int mask = 0, cur = lef[i];
		if (cur+rig[mask] > out) {
			out = cur+rig[mask];
			bestBlock = i;
			bestMask = mask;
		}
		for (int add : gray) {
			int c = cost[i][add];
			if (inc[add]) cur -= c;
			else cur += c;
			inc[add] = !inc[add];
			mask ^= (1<<add);
			if (cur+rig[mask] > out) {
				out = cur+rig[mask];
				bestBlock = i;
				bestMask = mask;
			}
		}
	}

	cout << __builtin_popcount(bestBlock) + __builtin_popcount(bestMask) << endl;
	for (int i = 0; i < blockSz; i++) {
		if (bestBlock&(1<<i)) cout << s[i];
	}
	for (int i = 0; i < n-blockSz; i++) {
		if (bestMask&(1<<(i+blockSz))) cout << s[i+blockSz];
	}

	cout << endl;
}