#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e6+5,M=(1<<17)+5,K=(1<<26)+5,mod=999911659,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n;char s[N];
string q[N];int H=1,T=0;
void clear(int x){
	q[x].clear();q[x].shrink_to_fit();
}
int eqt;
void construct(){
	// cerr<<H<<' '<<T<<' '<<eqt<<' '<<q[T]<<'\n';
	while(eqt<T&&q[eqt]!=q[T]) eqt++;
	int cnt=T-eqt+1;
	if(cnt<=eqt-1-H+1){
		for(int i=eqt;i<=T;i++) q[i]+=q[H++],clear(H-1);
		return construct();
	}
	string a=q[T];while(H<=T&&q[T]==a) clear(T),T--;
	if(H>T){
		while(cnt--) cout<<a;return;
	}
	for(int i=2;;i++)if((cnt+i-1)/i<=T-H+1){
		int p=(T-H+1-cnt%(T-H+1))%(T-H+1);
		string b=a;for(int j=2;j<i;j++) b+=a;
		int t=T;
		for(int j=t-p+1;j<=t;j++) q[j]=b+q[j],++T,swap(q[T],q[j]),clear(j);
		b+=a;
		for(int j=H;j<=t-p;j++) q[j]=b+q[j],++T,swap(q[T],q[j]),clear(j);
		H=t+1;
		return construct();
	}
	assert(0);
}
int main(){
	int i,j;scanf("%s",s+1);n=strlen(s+1);
	for(i=1;i<=n;i++) q[++T]=s[i];
	sort(q+H,q+T+1);reverse(q+H,q+T+1);
	eqt=T;while(eqt>H&&q[eqt-1]==q[T]) eqt--;
	construct();
}