Help me in solving BREAKSTICK problem

My issue

can someone help me understand what does the question ask u to do?

My code

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	return 0;
}

Problem Link: Break the Stick Practice Coding Problem - CodeChef

the questions asks you to identify if the stick of length n can be transformed into length x at any instant?

here the operation given is stick can be broken into any number of lengths any number of times such that it should be either both even or both odd

eg: 6 → 4 2
5 → 4 1 (Not possible as 4 is even and 1 is odd)

finally can you get the length x is the question