#include <bits/stdc++.h>

#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, a) FOR(i, 0, a)

using namespace std;
using ll = long long;

vector<ll> get_p_factors(ll n) {
    vector<ll> p_factors;
    for (ll i = 2; i * i <= n; ++i) {
        if (n % i == 0) {
            p_factors.push_back(i);
            while (n % i == 0) {
                n /= i;
            }
        }
    }
    if (n != 1) {
        p_factors.push_back(n);
    }
    return p_factors;
}

ll solve_w_period(string &S, ll period, bool replace_S = false) {
    ll n = S.length(), ans = 0;
    REP(i, period) {
        map<char, ll> char_cnt;
        REP(j, n / period) {
            ++char_cnt[S[i + period * j]];
        }
        auto max_cnt = *max_element(char_cnt.begin(), char_cnt.end(), [](auto a, auto b) { return a.second < b.second; });
        ans += n / period - max_cnt.second;
        if (replace_S) {
            REP(j, n / period) {
                S[i + period * j] = max_cnt.first;
            }
        }
    }
    return ans;
}

void solve(string &S) {
    ll n = S.length();
    vector<ll> p_factors = get_p_factors(n);

    ll ans = n, best_period = 1;
    for (ll p_factor : p_factors) {
        ll period = n / p_factor;
        ll temp_ans = solve_w_period(S, period);
        if (temp_ans < ans) {
            ans = temp_ans;
            best_period = period;
        }
    }
    solve_w_period(S, best_period, true);
}

int main() {
    string S;
    cin >> S;
    solve(S);
    cout << S << endl;
}