生成几组小数据，马上得到规律，a+b满足
f[1]=2;
f[2]=3;
f[3]=5;
....
f[n]=f[n-1]+f[n-2](n>=3)
由于题目需要对2^64取mod
所以直接使用矩阵乘法就可以快速的解决
f[n]      1 1     f[n-1]
       =       *
f[n-1]    1 0     f[n-2]
一直化下去可以得到实际上:
f[n] 

Calculate a + b

Input

The input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line.

Output

For each pair of input integers a and b you should output the sum of a and b in one line,and with one line of output for each line in input.

Sample Input

1 5
2 3

6
5