// ReverseIntRecurse2 - reverse the digits of an integer, returning it as the value
//  of a recursive method

import java.util.*;

public class ReverseIntRecurse2 {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int num;
		int digits = 0;
		int num2;
		
		System.out.print("Enter an integer: ");
		num = input.nextInt();
		num2 = num;
		
		digits = calcDigits(num);
		
		System.out.println(reverse(num, digits));

	}
	
	public static int calcDigits(int n) {
		if (n < 10)
			return 1;
		else 
			return 1 + calcDigits(n/10);
	}
	
	public static int reverse (int n, int digits) {

		if (n < 10)
			return n;
		else {
			return (n % 10) * (int) (Math.pow(10,digits-1)) + reverse(n/10, digits-1);
		}

	}
	
}