IWGBS  0110SS
Dor is IWGolymp student so he has to count in how many ways he can make N digit numbers that is formed by ones and zeroes. But zeroes can not be next to each other. Help to him in how many different numbers can he make.
For example, N = 3: 101, 010, 111, 110, 011
Note: A leading zero is allowed.
Input
A positive integer N (1 <= N <= 10000).
Output
Answer for the problem.
Example
Input: 2 Output: 3
hide comments
ameyanator:
20180324 20:48:46
easy dp problem but my mind whirled around when i saw the answer for n=10000 :P 

dunjen_master:
20180104 19:07:19
python rocks!! 

Rakend Chauhan:
20170708 13:50:31
big integer really not likes me :( 

cms118:
20170613 15:19:25
BigInteger Rocks!!


kshubham02:
20170328 08:16:23
5 lines in Python.


mukul arora:
20170225 20:45:54
Python would be good. 

prasoonbatham:
20170116 18:19:02
Iterative dp + BigInteger in Java :) 

vengatesh15:
20161231 10:45:06
Thanks for the problem learnt how to use BIGINT 

ndv17:
20160822 10:42:11
:D


mkfeuhrer:
20160711 21:06:47
easy in python if u get the dp relation! 
Added by:  Azat Taryhchiyev 
Date:  20120216 
Time limit:  0.100s3.085s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 