Show that S can have at most one object

Let S be a set having an operation ∗ which assigns an element a x b of S for any a, b  ∈  S . Let us assume that the following two rules hold: 

If a, b are any objects in S, then a x b  =  a . If a, b are any objects in S, then a x b  =  b x a .