Problem Statement

C is playing a certain game that uses numbers.
In this game, a positive number $N$ is given first.
The goal of the game is to skillfully extract several "cww numbers" from $N$ and make their sum as large as possible.

The details are as follows.

• A cww number is a number whose decimal representation is $cww$, where $c \neq 0, c \neq w$.
  • Example: 355 and 700 are cww numbers, but 123, 551, and 099 are not cww numbers.
• The game proceeds as follows.

$N = a_0 a_1 \dots a_{L-1}$ (10進数表記)
$I = \{0, 1, ..., L-1\}$
$score = 0$

while true:
	Iから異なる3つの要素i, j, kを選ぶ $( i < j < k )$
	x = a_i a_j a_k がcww数であるとき
		score += x
		Iからi, j, kを除く

	xがcww数となるようなi,j,kの選び方がなければ終了

Input

N

The input consists of a single line containing a positive integer $N$ ($1 \leq N \leq 10^{12}$).

Output

Output the maximum score that C can obtain on a single line, followed by a newline.

Sample

133144

344

11

0

2718281828

1821