Recursively solve monkey climbing

topic:

Monkey climbing: There are N steps, 0<N<=50, the monkey only jumps 1 or 3 steps at a time, input N, and output how many ways the monkey has to reach the end of the step.

Solve recursively:

public static void test(){
    Scanner scanner=new Scanner(System.in);
    int n=Integer.parseInt(scanner.nextLine());
    scanner.close();
    int num=count(0,n,n,0);
    System.out.println(num);
}
public static int count(int hasFinish,int noFinish,int n,int count){
    int countX=count;
    int hasFinishN=hasFinish;
    int noFinishN=noFinish;
    if (hasFinishN==n){
        return countX+1;
    }
    if (hasFinishN<n){
        hasFinishN=hasFinishN+1;
        noFinishN=noFinishN-1;
      countX=count(hasFinishN,noFinishN,n,countX);
    }
    if (noFinish+1>=3){
        hasFinishN=hasFinishN-1+3;
        noFinishN=noFinishN+1-3;
       countX=count(hasFinishN,noFinishN,n,countX);
    }
    return countX;
}