Jzzhu and Sequences

Jzzhu and Sequences
Jzzhu has invented a kind of sequences, they meet the following property:
f1=x,f2=y;对任意i>=2，fi=f（i-1）+f(i-2);

You are given x and y, please calculate fn modulo 1000000007 (109 + 7).

Input
The first line contains two integers x and y (|x|, |y| ≤ 109). The second line contains a single integer n (1 ≤ n ≤ 2·109).

Output
Output a single integer representing fn modulo 1000000007 (109 + 7).

Examples
Input
2 3
3
Output
1
Input
0 -1
2
Output
1000000006
Note
In the first sample, f2 = f1 + f3, 3 = 2 + f3, f3 = 1.

In the second sample, f2 =  - 1;  - 1 modulo (109 + 7) equals (109 + 6).

题意：f1=x,f2=y;输出fn的对1000000007取余的值。
代码如下：

在这里插入代码片
#include"cstdio"
#include"cstring"
#include"iostream"
#include"algorithm"
using namespace std;
int main()
{
	long long x , y , n;
	long long xx[10];
	while(cin>>xx[0]>>xx[1]>>n)
	{
		
		xx[0] = xx[0] % 1000000007;
		xx[1] = xx[1] % 1000000007;
		long long z;
		for(int i = 2 ; i < 6 ; i ++)
		{
			xx[i] = xx[i-1] - xx[i-2];
			xx[i] = xx[i] % 1000000007;
		}
		int a = n % 6;
		if(a == 0)
			a = 6;
				z = xx[a-1] + 1000000007;
				z = z % 1000000007;
		cout<<z<<endl; 
	}
	return 0;
}