Show that for every n>=3 there is a graph on n vertices in which all degrees are different.