/*
Antwort zu Teil a)
*/
import aud.Stack;
public class RecursionToStack {

    public static int whatRec(int n) {
        if (n < 10)
            return n;
        else
            return whatRec(n / 10) + n % 10;
    }

    public int getlength(int zahl){
   String s = String.valueOf(zahl);
   return s.length();
}

   public static int whatStack(int n) {
   int length = getlength(n);
      for (int i = 0; i < length; i++)
        // TODO: implementation
   }

   public static void main(String args[]) {
	// TODO: test
   }

}