|
||||||||||
The mook jongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1407 Accepted Submission(s): 893 Problem Description ![](../../data/images/C613-1001-1.jpg) ZJiaQ want to become a strong man, so he decided to play the mook jong”£ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is 1*n”£ZJiaQ want to put a mook jong in a brick. because of the hands of the mook jong£¬ the distance of two mook jongs should be equal or more than 2 bricks. Now ZJiaQ want to know how many ways can ZJiaQ put mook jongs legally(at least one mook jong). Input There ar multiply cases. For each case, there is a single integer n( 1 < = n < = 60) Output Print the ways in a single line for each case. Sample Input
Sample Output
Source | ||||||||||
|