Position: L3 New Grad

You are running an auction with n auctioneers. Each auctioneer is assigned a card with a unique number between 1 to n. Of these some cards may be flipped upside down. Write a program that returns all of the numbers between 1 and n that may be mistaken for another possible number.

Pairs of numbers that could be confused for each other include:
"108" and "801"
"68" and "89"