Day_9_Recursion_3.py

# Link to the complete Problem Statement: https://www.hackerrank.com/challenges/30-recursion/problem

# Solution

#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the factorial function below.
def factorial(n):
    if (n<2):
        return 1;
    return n*factorial(n-1)

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input())

    result = factorial(n)

    fptr.write(str(result) + '\n')

    fptr.close()