Interview Questions: determine whether an integer is an even number. At least three methods are required.

Just a few days after I came to Shanghai, I was looking for a job. When I was looking for a job, I met a company's interview question:

You must use at least three methods to determine whether an integer is an even number.

The time was too short. At that time, I only thought of two methods:

1. If the remainder n % 2 = 0 for 2 is an even number

2. the bitwise operation N & 1 = 0 is an even number (I wrote N & 0xfe at the time, a little nervous)

 

I'm not sure about the third method at the moment, but I think of it as follows:

If we get the last bit of N, we can see whether it can be divisible by 2, but the operation of getting the last bit is much more complicated than getting the remainder directly. Do you know if this can be calculated?

 

If you know something, please tell me. Thank you.