#! usr/env/bin python
# -*- coding:utf-8 -*-

import math
import numpy as np

if __name__ == "__main__":
    N = raw_input()
    N = int(N)
    
    I = range(int(math.log10(N) + 1))
    #print I
    
    score = 0
    A = []
    n = N
    for i in I:
        tmp = [int(n / (10**(len(I)-i-1)))]
        A = A + tmp
        n = n - (10**(len(I)-i-1))*A[-1]
        #print n
        #print A

    l = A
    candidate = [];
    for i in range(len(l)-2):
        for j in range(i+1, len(l)-1):
            for k in range(j+1, len(l)):
                if l[i] != 0 and l[i] != l[j] and l[j] == l[k]:
                    candidate.append([i,j,k])

    #print candidate
    maxscore = 0
    cand = []
    for key in range(len(candidate)):
        score = 0
        cand[:] = candidate
        tmp = cand[key]
        i = tmp[0]
        j = tmp[1]
        k = tmp[2]
        
        score += l[i]*100 + l[j]*10 + l[k]
        x = len(cand)-1
        while x >= 0:
            if i in cand[x]:
                cand.pop(x)
            elif j in cand[x]:
                cand.pop(x)
            elif k in cand[x]:
                cand.pop(x)
            x -= 1
        while len(cand) > 0:
            tmp = cand[0]
            i = tmp[0]
            j = tmp[1]
            k = tmp[2]
            score += l[i]*100 + l[j]*10 + l[k]
            x = len(cand)-1
            while x >= 0:
                if i in cand[x]:
                    cand.pop(x)
                elif j in cand[x]:
                    cand.pop(x)
                elif k in cand[x]:
                    cand.pop(x)
                x -= 1
        if score > maxscore:
            maxscore = score
        #print candidate
    print maxscore
    print '\r'    
    #print score