How Persistent am I? Your Task:

Write a program or function that, when given a number, outputs its persistence.  The persistence of a number is the number of times you can add its digits before arriving at a one-digit number.  All one digit numbers have a persistence of 0.  Note that this is different from questions about finding the digital root, as those questions ask for the end result of this process, whereas this question wants the number of steps required to get there.  

Input:

An integer.  

Output:

The persistence of the inputted integer.  

Examples:

1--&gt;0 (1=1)
12--&gt;1 (1+2=3)
99--&gt;2  (9+9=18, 1+8=9)
9999--&gt;2 (9+9+9+9=36, 3+6=9)


Scoring:

This is  code-golf, lowest score in bytes wins.
Python 2, 50 39 bytes

-10 thanks to @JonathanAllan



f=lambda x:x&gt;9and-~f(sum(map(int,`x`)))


Try it online!