class Solution {
public:
int fib(int n) {
int a[105];
int k = 1000000007;
a[0] = 0;
a[1] = 1;
for(int i=2; i<=n; ++i){
a[i] = (a[i-1]+a[i-2])%k;
}
return a[n];
}
};
class Solution {
public:
int fib(int n) {
int a[105];
int k = 1000000007;
a[0] = 0;
a[1] = 1;
for(int i=2; i<=n; ++i){
a[i] = (a[i-1]+a[i-2])%k;
}
return a[n];
}
};