A. Dragons
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In the whimsical land of Sweetonia, there live two tiny candy dragons: Choco and Caramel. Every morning, they collect candies from the Candy Forest.

Choco finds $$$a$$$ candies.

Caramel finds $$$b$$$ candies.

They want to put all their candies together in a magical jar to share with the village kids.

Your task is to help them find out how many candies they have in total.

Input

The input consists of a single line containing two integers, $$$a$$$ and $$$b$$$ ($$$1 \le a, b \le 100$$$), representing the number of candies found by Choco and Caramel, respectively.

Output

Print a single integer representing the total number of candies Choco and Caramel collected together.

Examples
Input
3 5
Output
8
Input
1 1
Output
2