$N$ undercover agents have been found in don's lair. Less than half of them are terrorists and the rest are anti-terrorists. The nature of their job is so secret that there is no proof whatsoever to testify who is who. However, each of them knows who was the actual terrorist and who was the anti-terrorist because they worked in teams.

A query consists of asking person $i$ if person $j$ is anti. Anti will always speak truth but a terrorist may lie to confuse you. What is the fewest number of queries required to find the anti?