#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;
#include <atcoder/modint>
using Modint = atcoder::static_modint<998244353>;

void testcase(){
    string S; cin >> S;
    int N = S.size();
    int n = N;
    int ans = N;
    string ansS;
    for(int p=2; p<=N; p++) if(n%p == 0){
        while(n%p == 0) n /= p;
        int tmp = N;
        string tmpS = S;
        int q = N / p;
        rep(k,q){
            int X[26] = {};
            for(int x=k; x<N; x+=q) X[S[x]-'A'] += 1;
            char f = 'A' + (max_element(X, X+26) - X);
            for(int x=k; x<N; x+=q) tmpS[x] = f;
            tmp -= X[f - 'A'];
        }
        if(ans > tmp){
            swap(ansS, tmpS);
            swap(ans, tmp);
        }
    }
    cout << ansS << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}