该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Description

Consider an infinite sequence of numbers consisting of all natural numbers arranged in ascending order. That is, consider the sequence $S = 12345678910111213141516171819202122 \ldots$. Let $S_i$ denote the $i$'th number in the sequence; \emph{e.g.} $S_1 = 1, S_2 = 2, \ldots, S_{10} = 1, S_{11} = 0$, etc.

Let $B$ be a given input value. Give an algorithm to compute the smallest index in $S$ where $B$ occurs. For example, if $B=101$, then the index is 10, since $S_{10} S_{11} S_{12} = 101$, and no earlier substring of $S$ equals 101.

Format

Input

A string representing the value $B$, with no more than 200 digits.

Output

he smallest positive integer $k$ for which $B_{1}=S_{k}, B_{2}=S_{k+1}, \ldots, B_{r}=S_{k+r-1}$ is true, where $r$ is the number of digits in $B$.

Samples

input1 : 101
output1 : 10

input2 : 81
output2 : 27