Where a large jump occurs in the distance coefficient between clusters, the number of clusters immediately before the jump-up is likely to be the most suitable solution.
Ward’s method starts with (in this case) k = 408 (number of objects to cluster) then iteratively joins cases and clusters such that the variance between the cases in the cluster is minimised until k = 1.