Distinct distances on a chessboard



Consider the 8x8 integer lattice : {(x,y) | 0 <= x <= 7 and 0 <= y <=
7, x, y integers}

Can we select some 8 points from the lattice such that all the 28
pairwise distances of the 8 selected points are distinct?

.