class Solution {
public int numWays(int n) {
if (n == 0 || n == 1) {
return 1;
}
int[] F=new int[n+1];
F[0]=1;
F[1]=1;
for(int i=2;i<=n;i++){
F[i]=(F[i-1]+F[i-2])%1000000007;
}
return F[n];
}
}