For this Question: Given an 8*8 empty chessboard in which a knight is placed at a position (X, Y). Your task is to find the number of positions in the chessboard  knight can jump into in a single move .

Note:- Rows and Columns are numbered through 1 to N.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Knight()</b> that takes integers X and Y as arguments.

Constraints:-
1 <= X <= 8
1 <= Y <= 8Return the number of positions Knight can jump into in a single move.Sample input:-
4 5

Sample Output:-
8

Explanation:-
Positions:- (3, 3), (5, 3), (3, 7), (5, 7), (6, 6), (6, 4), (2, 6), (2, 4)

Sample input:-
1 1

Sample Output:-
2

Explanation:-
Positions:- (3, 2), (2, 3), I have written this Solution Code: int Knight(int X, int Y){
int cnt=0;
if(X>2){
if(Y>1){cnt++;}
if(Y<8){cnt++;}
}
if(Y<7){
if(X>1){cnt++;}
if(X<8){cnt++;}
}
if(X<7){
if(Y>1){cnt++;}
if(Y<8){cnt++;}
}
if(Y>2){
if(X>1){cnt++;}
if(X<8){cnt++;}
}
return cnt;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?