#include #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; pair solve_w_period(string S, ll period) { ll n = S.length(), ans = 0; vector char_cnt_vec; bool flg = (n / period * 2 < 13); if (!flg) { char_cnt_vec.resize('Z' - 'A' + 1); } REP(i, period) { map char_cnt; pair max_cnt; if (flg) { REP(j, n / period) { ++char_cnt[S[i + period * j]]; } max_cnt = *max_element(char_cnt.begin(), char_cnt.end(), [](auto a, auto b) { return a.second < b.second; }); }else{ REP(j, n / period) { ++char_cnt_vec[S[i + period * j] - 'A']; } ll max_ele = max_element(char_cnt_vec.begin(), char_cnt_vec.end()) - char_cnt_vec.begin(); max_cnt.first = 'A' + max_ele; max_cnt.second = char_cnt_vec[max_ele]; if (n / period < 26){ REP(j, n / period) char_cnt_vec[S[i + period * j] - 'A'] = 0; }else{ fill(char_cnt_vec.begin(), char_cnt_vec.end(), 0); } } ans += n / period - max_cnt.second; REP(j, n / period) { S[i + period * j] = max_cnt.first; } } return make_pair(ans, S); } string solve(const string &S) { ll n = S.length(); auto ans = make_pair(n, S); for (ll period = 1; period * period <= n; ++period) { if (n % period == 0) { auto temp_ans = solve_w_period(S, period); if (temp_ans.first < ans.first) { ans = temp_ans; } if (period != 1) { temp_ans = solve_w_period(S, n / period); if (temp_ans.first < ans.first) { ans = temp_ans; } } } } return ans.second; } int main() { cin.tie(0); ios::sync_with_stdio(false); string S; cin >> S; cout << solve(S) << endl; }