n = input()
c = 0
while len(n) > 1:
n = str(sum(map(int,n)))
c += 1
print(c)
#include <iostream>
#include <queue>
using namespace std;
int sumOfDigits(int x) {
int sum = 0;
while (x > 0) {
sum += x % 10;
x /= 10;
}
return sum;
}
int sumOfDigitsString(string x) {
int sum = 0;
int len = x.length();
for (int i = 0; i < len; ++i) {
sum += x[i] - '0';
}
return sum;
}
void solve () {
string x;
cin >> x;
if (x.length() < 2) {
cout << 0;
return;
}
int newX = sumOfDigitsString(x);
int counter = 1;
while ( newX > 9 ) {
newX = sumOfDigits(newX);
++counter;
}
cout << counter;
}
int main() {
solve();
return 0;
}
1281B - Azamon Web Services | 1702A - Round Down the Price |
1681C - Double Sort | 12A - Super Agent |
1709A - Three Doors | 1680C - Binary String |
1684B - Z mod X = C | 1003A - Polycarp's Pockets |
1691B - Shoe Shuffling | 1706A - Another String Minimization Problem |
1695B - Circle Game | 1702B - Polycarp Writes a String from Memory |
1701A - Grass Field | 489C - Given Length and Sum of Digits |
886B - Vlad and Cafes | 915A - Garden |
356A - Knight Tournament | 1330A - Dreamoon and Ranking Collection |
1692B - All Distinct | 1156C - Match Points |
1675A - Food for Animals | 1328C - Ternary XOR |
1689A - Lex String | 1708B - Difference of GCDs |
863A - Quasi-palindrome | 1478A - Nezzar and Colorful Balls |
1581B - Diameter of Graph | 404A - Valera and X |
908A - New Year and Counting Cards | 146A - Lucky Ticket |