def bfs(start,adl): distan={start,0} que=[start] for v in que: for u in que: if u in distan:continue distan[u]=distan[v]+1 que.append(u) print(distan) return distan def f(n): x=0 while n!=0: x+=(n%10)**3 n=n//10 return x start = int(input()) adj={} for i in range (1,10): adj[i]=[f(i)] ans= bfs(start,adj) print(len(ans),sorted(ans))