I think you should take a step back, and first understand the requirements for when a year is a leap year. That should help determining the kind of logical operator you need
don’t know how common this knowledge is, but when dealing with whole centuries (1500, 1600, 1700, 1800, 1900, 2000, 2100) there is an exception to the divisible by four rule
only when the century is divisively by 400 is the century a leap year. so 1600 and 2000 are leap years, while 1700, 1800, 1900 are not
The algorithm the exercise decides to use determines with this edge case is to check if divisible by 4 and not divisible by 100 (not a century), or divisible 400.
This is something we developers have to deal with a lot, understanding the real life scenarios and then expressing them into code.