#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>

// #pragma GCC optimize("O3")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")

using namespace std;

#define ll long long
#define ld long double

typedef complex<ld> point;

#define polar(r, t) ((r)*exp(point(0, (t))))
#define length(a) (hypot((a).imag(), (a).real()))
#define rotate(v, t) (polar(v, t))
#define X real()
#define Y imag()
#define cp(a, b) ((conj(a) * (b)).imag())
#define EPS 1e-13
// #define M_PI acosl(-1.0l)

const int N = 254 + 5, lg = 19, mod = 998244353;
const int M = 1e7 + 5;
const int INF = 1e9;

int dp[N][N], n;
string s;

bool solve(int a, int b) {
    if (a > b) {
        return true;
    }
    auto &ret = dp[a][b];
    if (ret != -1) {
        return ret;
    }
    ret = false;
    for (int i = a + 2; i <= b - 1; i += 2) {
        if (solve(a, i - 1) && solve(i, b)) {
            ret = true;
            break;
        }
    }
    if (!ret && b - a >= 3 && s[a] != s[b]) {
        ret = solve(a + 2, b - 2);
    }
    return ret;
}

void build(int a, int b) {
    if (a > b) {
        return;
    }
    for (int i = a + 2; i <= b - 1; i += 2) {
        if (solve(a, i - 1) && solve(i, b)) {
            build(a, i - 1);
            build(i, b);
            return;
        }
    }
    cout << '[';
    build(a + 2, b - 2);
    cout << ']';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    // loc[0]['I'] = 1;
    // loc[0]['J'] = 5;
    // loc[0]['L'] = 8;
    
    // loc[1]['L'] = 1;
    // loc[1]['O'] = 4;
    // loc[1]['S'] = 6;
    // loc[1]['T'] = 8;
    
    // loc[2]['L'] = 1;
    // loc[2]['O'] = 4;
    // loc[2]['T'] = 6;
    // loc[2]['Z'] = 8;
    
    cin >> s;
    n = s.size();
    memset(dp, -1, sizeof(dp));
    if (solve(0, n - 1)) {
        build(0, n - 1);
        cout << '\n';
    } else {
        cout << "Keine Loesung" << '\n';
    }
    return 0;
}