S (n) = n E(n) / 2

Let E denote the Euler totient; E(n) is the number of integers  r =1,2,3,....., n
such that (r, n) = 1. Define S (n) as the sum of those E(n) integers.
Show that for n > 2, S (n) = n E(n) / 2.