#include <stdio.h>
#define LL long long
int N,I;
LL A[100];
int main()
{
	scanf("%d",&N);
	A[0]=2;
	A[1]=1;
	for(I=2;I<=N;I++)
	A[I]=A[I-1]+A[I-2];
	printf("%lld",A[N]);
	return 0;
}
### Prompt

Develop a solution in Cpp to the problem described below:

It is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.

You are given an integer N. Find the N-th Lucas number.

Here, the i-th Lucas number L_i is defined as follows:

* L_0=2
* L_1=1
* L_i=L_{i-1}+L_{i-2} (i≥2)

Constraints

* 1≤N≤86
* It is guaranteed that the answer is less than 10^{18}.
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

Print the N-th Lucas number.

Examples

Input

5


Output

11


Input

86


Output

939587134549734843

### Response

```cpp
#include <stdio.h>
#define LL long long
int N,I;
LL A[100];
int main()
{
	scanf("%d",&N);
	A[0]=2;
	A[1]=1;
	for(I=2;I<=N;I++)
	A[I]=A[I-1]+A[I-2];
	printf("%lld",A[N]);
	return 0;
}
```