Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness