// Two function to computing quotient and remainder
int quotient (int z ) { return z / 10; }
int reminder ( int z ) { return z % 10; }
 
// Simple solution to split int number into its digits
void demon ()
{  int n, d0, d1, d2, d3, d4;
   cout << "Enter an integer between 1 and 32767: ";
   cin >> n;
   cout << n << endl;
   d4 = reminder(n); n = quotient(n);
   d3 = reminder(n); n = quotient(n);
   d2 = reminder(n); n = quotient(n);
   d1 = reminder(n); d0= quotient(n);
   cout << d0 << "  " << d1 << "  " << d2 << "  " << d3 << "  " << d4 << endl;
}
 
 
//  Below solution works recursively. Do you understand this?
//  if you call split (4562), result is 4 5 6 2
void split(int n){
   int d = n % 10; n = n / 10;
   if ( n > 0) split (n);
   cout << d << "  ";
}