# Don't Guess 2 High Or 2 Low 2 Often!

**Logic**Level 4

You are asked to guess an integer between \(1\) and \(N\) inclusive.

Each time you make a guess, you are told either

**(a)** you are too high,

**(b)** you are too low, or

**(c)** you got it!

You are allowed to guess too high twice and too low twice, but if you have a \(3^\text{rd}\) guess that is too high or a \(3^\text{rd}\) guess that is too low, you are out.

What is the maximum \(N\) for which you can guarantee to be able to accomplish this?

**Clarification**: For example, if you were allowed to guess too high once and too low once, you could guarantee to guess the right answer if \(N=5\), but not for \(N>5\). So, in this case, the answer would be \(5\).