This program (suggested by Dr. Bradley) implements a random walk in
three dimensions.  A point in a three-dimensional coordinate system
starts at (0,0,0), and at each time step it moves by one unit in some
direction: positive or negative x, positive or negative y, or positive
or negative z, chosen at random.  After a certain number of time steps
(specified by input), compute the distance of the point from the origin
and print it out.

Input: a sequence of lines, each containing a nonnegative integer
indicating how many time steps to run.

Output: for each line of input, produce one line of output containing
the number of time steps and the final distance.