Back
Close

Stair Calculator

Statement

 Goal

Bill is a roof mechanic, and he has to go up different sized flights of stairs every day. Bill likes to take the stairs two at a time, skipping every other stair. Given a flight of stairs with N steps, calculate whether or not Bill will land on the top step.
Input
Line 1: An integer N for the number of steps.
Output
Yes or No for whether or not Bill will land on the top step.
Constraints
2<N<10000
Example
Input
9
Output
No

Game modes
Fastest, Shortest

Test cases
Example Test
Input
9
Output
No

Validator 1 Validator
Input
7
Output
No

Test 2 Test
Input
16
Output
Yes

Validator 2 Validator
Input
20
Output
Yes

Test 3 Test
Input
400
Output
Yes

Validator 3 Validator
Input
401
Output
No

Test 4 Test
Input
5005
Output
No

Validator 4 Validator
Input
11
Output
No

Solution language

Solution

Stub generator input