注意 if 判断的位置

from math import sqrt,ceil,gcd,log;re=lambda:map(int,input().strip().split())
x, = re()
cnt = 0
while True:
    if int(str(x)) == int(str(x)[::-1]):
        print(cnt)
        break
    x += int(str(x)[::-1])
    cnt += 1

#include<stdio.h>

long long hw(long long x)//自定义反转函数
{
	long long y = 0;
	while(x > 0)
	{
		y *= 10;
		y += x % 10;
		x /= 10;
	}
	return y;
}

int main()
{
	long long x;
	scanf("%lld", &x);
	long long ct = 0, y = hw(x);
	while(x != y)
	{
		ct++;
		x += y;
		y = hw(x);
	}
	printf("%lld", ct);
	return 0;
}