Score : $100$ points
Two boys, A and B, will share $N$ indistinguishable sweets. How many ways are there to do this so that each boy gets a positive integer number of sweets?
Input is given from Standard Input in the following format:
Print the answer as an integer.
There is only one way to share the sweets: A and B get one sweet each.