Same this time wrong answer but first test case answer match

#include
#include
using namespace std;
long long int fib(long long int n){
if(n==0){
return 1;
}
if(n==1 ){
return n+1;
}
return fib(n-2) +fib(n-1);
}
int main() {
int t;
cin>>t;
while(t–){
long long int n;
cin>>n;
int count=0;

	cout<<"#"<<n<<" : "<<fib(n)<<endl;
}
return 0;

}

hi @kumawatnitesh093
updated