Sanggeun's Friends

Sanggeun has $M$ male friends and $F$ female friends. Given these two numbers, write a program that finds the total number of friends.

The input consists of several test cases. Each test case is a line with two integers $M$ and $F$, the number of Sanggeun's male friends and female friends respectively ($1 \le M, F \le 5$).

The last line of the input contains two zeros.

For each test case, print the total number of Sanggeun's friends on its own line.