package no437;

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		int n = s.length();
		int[] x = new int[n];
		for(int i=0;i<n;i++) {
			x[i] = s.charAt(i) - '0';
		}
		int m = (n + 2) / 3;
		int[] p = new int[n];
		int[] a = new int[m];
		int max = 0;
		do {
			int score = 0;
			Arrays.fill(a, 0);
			for(int i=0;i<n;i++) {
				int j = p[i];
				int c = x[i];
				if (a[j] == 0 && c == 0) {
					continue;
				}
				if (a[j] >= 100) {
					continue;
				}
				a[j] = a[j] * 10 + c;
			}
			for(int i=0;i<m;i++) {
				if (a[i] < 100 || a[i] % 111 == 0 || a[i] % 100 % 11 != 0) {
					continue;
				}
				score += a[i];
			}
//			if (max < score) {
//				System.out.println(score + " " + Arrays.toString(a));
//			}
			max = Math.max(max, score);
		} while (nextSequence(p, m));
		System.out.println(max);
	}
	public static boolean nextSequence(int[] s, int k) {
		int n = s.length;
		for(int i=0;i<n;i++) {
			s[i]++;
			if (s[i] < k) {
				return true;
			}
			s[i] = 0;
		}
		return false;
	}
}