CF540A Combination Lock

Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock. The combination lock is represented by $ n $ rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn some disks so that the combination of digits on the disks forms a secret combination. In one move, he can rotate one disk one digit forwards or backwards. In particular, in one move he can go from digit 0 to digit 9 and vice versa. What minimum number of actions does he need for that?

The first line contains a single integer $ n $ ( $ 1

Print a single integer — the minimum number of moves Scrooge McDuck needs to open the lock.

In the sample he needs 13 moves: - 1 disk:  - 2 disk:  - 3 disk:  - 4 disk:  - 5 disk: