What is the greatest possible value for STATS in the cryptarithm shown here given that V = 1? [Different letters represent different digits, and no leading digit can equal 0.]

What is the greatest possible value for STATS in the cryptarithm shown here given that V 1 Different letters represent different digits and no leading digit can class=