class Solution {
public int fib(int n) {
if (n == 1 || n==0) {
return n==1 ? 1:0;
}
return fib(n-1) +fib(n-2);
}
}
class Solution {
public int fib(int n) {
if (n == 1 || n==0) {
return n==1 ? 1:0;
}
return fib(n-1) +fib(n-2);
}
}