H

#include <bits/stdc++.h>


using namespace std;

#define int long long

const long long INF = 1e18 + 7;
const int MAXN = 1e2 + 10;
const int N = 1e5 + 10;

string dp[MAXN][MAXN];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    string s;
    cin >> s;
    int n = s.size();
    for (int len = 1; len <= n; ++len) {
        for (int l = 0; l + len - 1 < n; ++l) {
            int r = l + len - 1;
            dp[l][r] = s.substr(l, len);

            for (int m = l; m <= r; ++m) {
                if (dp[l][r].size() > dp[l][m].size() + dp[m + 1][r].size()) {
                    dp[l][r] = dp[l][m] + dp[m + 1][r];
                }
            }

            for (int p = 1; p <= len; ++p) {
                if (len % p == 0) {
                    bool flag = true;
                    for (int k = l + p; k <= r; ++k) {
                        if (s[k] != s[k - p]) {
                            flag = false;
                            break;
                        }
                    }
                    if (flag) {
                        string tmp = to_string(len / p) + "(" + dp[l][l + p - 1] + ")";
                        if (dp[l][r].size() > tmp.size()) {
                            dp[l][r] = tmp;
                        }
                    }
                }
            }
        }
    }
    cout << dp[0][n - 1] << '\n';
}