Given an integer n, which may be negative, determine whether it's odd. Dividing by 2 and checking the remainder works, but there's a more direct route: parity lives entirely in a number's lowest bit. ANDing n with 1 reads that bit straight from its binary representation — no division involved, and the trick holds for negative numbers just as cleanly as positive ones.