Week 1 Introduction Part 1

Stepan Friends

Time limit 1 second
Memory limit 128 MiB

Stepan returned from International Olympiad in Informatics (IOI) and brought with him n colored stones as souvenirs. Stepan is not a greedy boy, so he decided to share stones with his friends. Stepan gave to each friend exactly one stone. It turned out that Stepan has now also only one stone. Determine how many friends has Stepan.

Input data

One number n (1n100).

Output data

Print the number of Stepan's friends.


Input example #1
Output example #1


Stepan brought 2 stones, one of which he left for himself. So the second stone he gave to his one friend.

Source 2015 ACM-ICPC Ukraine, Первый этап Украина, 25 апреля