#include <bits/stdc++.h>
using namespace std;

short n;
short d[2005][2005], Next[2005][11], Last[2005][11];
char s[2005], sol[2005];
short p, u;
inline void solve(short st, short dr, short k){
    if(st > dr) return ;
    if(k < 0) return ;
    for(short j = 9; j >= 0 ; --j){
        if(d[Next[st][j]][Last[dr][j]] == k){
            sol[p++] = j + '0';
            sol[u--] = j + '0';
            solve(Next[st][j] + 1, Last[dr][j] - 1, k - 2);
            return ;
        }
    }
}
inline short max(short x, short y){
    if(x < y) return x;
    return y;
}
int main()
{
    freopen("elimin2.in", "r", stdin);
    freopen("elimin2.out", "w", stdout);
    scanf("%s", s + 1);
    n = strlen(s + 1);
    for(short i = 1; i <= n ; ++i) d[i][i] = 1;
    for(short k = 1; k < n ; ++k){
        for(short i = 1; i + k <= n ; ++i){
            short j = i + k;
            d[i][j] = max(d[i + 1][j], d[i][j - 1]);
            if(s[i] == s[j]) d[i][j] = max(d[i][j], d[i + 1][j - 1] + 2);
        }
    }
    for(short i = 1; i <= n ; ++i){
        for(short j = 0; j <= 9 ; ++j)
            Last[i][j] = Last[i - 1][j];
        Last[i][s[i] - '0'] = i;
    }
    for(short j = 0; j <= 9 ; ++j) Next[n + 1][j] = n + 1;
    for(short i = n; i >= 1 ; --i){
        for(short j = 0; j <= 9 ; ++j)
            Next[i][j] = Next[i + 1][j];
        Next[i][s[i] - '0'] = i;
    }
    p = 1; u = d[1][n];
    solve(1, n, d[1][n]);
    printf("%s", sol + 1);
    return 0;
}