int count=0,cache[50];
int f(int n)
{
if(n==2) count++;
if(n==0 || n==1) return n;
else if(cache[n]!=-1) return cache[n];
else cache[n]= f(n-1)+f(n-2);
return cache[n];
}
int main(){return 0;}
aW50IGNvdW50PTAsY2FjaGVbNTBdOwoKaW50IGYoaW50IG4pCnsgIAogICAgaWYobj09MikgY291bnQrKzsKICAgIGlmKG49PTAgfHwgbj09MSkgcmV0dXJuIG47CiAgICBlbHNlIGlmKGNhY2hlW25dIT0tMSkgcmV0dXJuIGNhY2hlW25dOwogICAgZWxzZSBjYWNoZVtuXT0gZihuLTEpK2Yobi0yKTsKICAgIHJldHVybiBjYWNoZVtuXTsgCn0KCmludCBtYWluKCl7cmV0dXJuIDA7fQ==