public class Factorial {

    public static int facIteration(int n) {
        int resultat = 1;
        for(int i = 1; i <= n; i++) {
            resultat *= i;
        }
        return resultat;
    }

    public static int facRecursion(int n) {
        if(n <= 1) return 1; // base case
        return n * facRecursion(n - 1);
    }


    
    public static void main(String[] args) {
        System.out.println(facIteration(200));
        System.out.println(facRecursion(200));
    }
}