The distance between two arbitrary vertices of a tree is defined as the length of the simple path connecting them. The remoteness of a vertex in a tree is defined as the sum of the distances from it to all other vertices. Prove that a tree with two vertices having remotenesses differing by 1 has an odd number of vertices.