Back
Close

Missing Jerseys

Statement

 Goal

A school organizes a chocolate distribution event.

Children are assigned jersey numbers starting from 1 in increasing order. Every jersey number that is a multiple of 10 is skipped (10, 20, 30, ... are missing). Each child receives a number of chocolates equal to the number printed on their jersey.

Given the total number of chocolates distributed, determine the total number of children.
Input
Line 1: An integer C representing the total number of chocolates distributed.
Output
Line 1: Print a single integer N, where N is the total number of children.
Constraints
1 ≤ C ≤ 1000

It is guaranteed that the given value of C corresponds to a valid arrangement.
Example
Input
1
Output
1

Game modes
Fastest, Shortest

Test cases
Test 1 Test
Input
1
Output
1

Validator 1 Validator
Input
3
Output
2

Test 2 Test
Input
45
Output
9

Validator 2 Validator
Input
36
Output
8

Test 3 Test
Input
201
Output
19

Validator 3 Validator
Input
436
Output
28

Test 4 Test
Input
535
Output
31

Validator 4 Validator
Input
570
Output
32

Test 5 Test
Input
720
Output
36

Validator 5 Validator
Input
405
Output
27

Test 6 Test
Input
981
Output
42

Validator 6 Validator
Input
935
Output
41

Solution language

Solution

Stub generator input