Henry starts with a list of the first 1000 positive integers and performs a series of steps on the list. At each step, he erases any non-positive integers or any integers that have a repeated digit, and then decreases everything in the list by 1. How many steps does it take for Henry's list to be empty?

Let's think step by step and output the final answer within \boxed{}.
user