How to find factorial of an integer value

This is the third solution to find the factorial of long integer value. This solution uses the recursion approach. The recursive function should have an exit condition to stop function calling itself infinite number of times.

import java.util.Scanner;

public class FactorialRecursion {

	public static void main(String[] args) {

		//Take the input here into the long integer variable
		Scanner inpInt=new Scanner(System.in);
		System.out.println("Enter a number for which you need factorial value:");
		long inpNum=inpInt.nextLong();
		
		System.out.println("The factorial of "+inpNum+" using recursion "+factRecursion(inpNum));
		inpInt.close();
	}

	private static long factRecursion(long inpNum) {
		
		//This is an exit condition to stop the recursion
		if (inpNum == 0 || inpNum == 1)
			return 1;
		else
			return (inpNum*factRecursion(inpNum-1));
	}
}
Output:
Enter a number for which you need factorial value:
12
The factorial of 12 using recursion 479001600