Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

RGB7606 - Фибоначчийн n дахь гишүүн

F1=1, F2=1, Fn=Fn-1+Fn-2 томьёо өгөгдсөн бол n-р гишүүнийг ол.

Input

Натурал тоо өгөгдөнө. 1<=n<=45.

Output

Fn

Example

Input:

3

Output:

2


Нэмсэн:Bataa
Огноо:2013-01-24
Хугацааны хязгаарлалт:1s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:ADA95 ASM32 BASH BF C NCSHARP CSHARP C++ 4.3.2 CPP C99 CLPS LISP sbcl LISP clisp D ERL FORTRAN HASK ICON ICK JAVA JS-RHINO JULIA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON PYPY3 PYTHON3 RUBY SCALA SCM guile ST TCL WHITESPACE

hide comments
2022-09-23 01:32:29
Scanner scan = new Scanner (System.in);
boolean f=true;
int nu1=0;
while(f)
{System.out.print("A=");
nu1 = scan.nextInt();
if(1<=nu1&&nu1<=45)
f=false;
else
{
System.out.print("1<=n<=45!");}
}
int arr[]=new int[100000];
int a1=0,b=nu1-1,c=nu1-2;
for(int i=0;i<=(nu1-1);i++)
{
int a=1;
arr[i]=a;
}
a1=arr[b]+arr[c];
System.out.print(a1);
2022-05-26 02:21:56
EZZZZZ
2022-05-26 02:21:56
EZZZZZ
2022-05-26 02:21:56
EZZZZZ
2022-05-26 02:21:56
EZZZZZ
2022-05-26 02:21:56
EZZZZZ
2022-05-26 02:21:56
EZZZZZ
2022-05-26 02:21:55
EZZZZZ
2022-05-26 02:21:55
EZZZZZ
2022-05-26 02:21:55
EZZZZZ
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.