public class Solution {
    public int rectCover(int target) {
        if(target <=3) return target;

        int[] dp= new int[target+1];
        for(int i=0;i<4;i++){
            dp[i] = i;
        }
        for(int i=4;i<target+1;i++){
            dp[i] = dp[i-1]+dp[i-2];
        }

       return dp[target];

    }
}