import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readToken();
      const L = cast(int)(N.length);
      
      auto dp = new int[1 << L];
      foreach (p; 0 .. 1 << L) {
        foreach (i; 0 .. L) foreach (j; i + 1 .. L) foreach (k; j + 1 .. L) {
          if (!(p & 1 << i) && !(p & 1 << j) && !(p & 1 << k)) {
            if ('0' != N[i] && N[i] != N[j] && N[j] == N[k]) {
              int score;
              score += (N[i] - '0') * 100;
              score += (N[j] - '0') * 10;
              score += (N[k] - '0') * 1;
              chmax(dp[p | 1 << i | 1 << j | 1 << k], dp[p] + score);
            }
          }
        }
      }
      writeln(dp[$ - 1]);
    }
  } catch (EOFException e) {
  }
}