Plus 2 or Minus 1

Chef has a number $X$ whose value is initially $0$. In one move, he can do one of the following: - Increment $X$ by $2$ i.e. $X := X + 2$ - Decrement $X$ by $1$ i.e. $X := X - 1$ He can perform **at most** $Y$ moves. He wants to determine how many distinct values can $X$ have after performing at most $Y$ moves. ### Input - The first line of input will contain a single integer $T$, denoting the n