#include using namespace std; /////////////////////////////////////////// const long long int INF = 1LL<<60; const long long int Mod = 1000000007; using ll = long long int; using ci = const int; using vi = vector; using Vi = vector; using P = pair; using PLL = pair; using matrix = vector>; #define pb(x) push_back(x) #define mp(x,y) make_pair(x,y) #define all(x) (x).begin(),(x).end() #define rp(i,N) for(ll i = 0; i < (ll)N; i++) #define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i) templatebool chmax(T &former, const T &b) { if (formerbool chmin(T &former, const T &b) { if (bT sqar(T x){ return x*x; }//sqrt(x)は平方根; #define Sort(v) std::sort(v.begin(), v.end(), std::greater()) //降順でVをソート #define p_queue(v) priority_queue, greater > template inline void princ(T x){cout< inline void print(T x){cout< inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; } template inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; } /////////////////////////////////////////////////////////////////////////////////// ll digitsum(ll x){ ll sum=0; while(x>0){ sum+=x%10; x/=10; } return sum; } void solve(){ ll n; cin >> n; rp(i,99){ n=digitsum(n); } print(n); return; } int main(){ cin.tie(0);ios::sync_with_stdio(false); std::cout<