class Solution {
public int numWays(int n) {
if(n==0||n==1){
return 1;
}
if(n==2){
return 2;
}
int first=1;
int second=2;
int res=0;
for(int i=3;i<=n;i++){
res=(first+second)%1000000007;
first=second%1000000007;
second=res%1000000007;
}
return res%1000000007;
}
}