public static int findNum(int arr []){
    int n=0;
    for(int i =0;i<arr.length;i++){
        n^=arr[i];
    }
    return n;
}

public  static int fibo(int n){
    if(n==1){
        return 0;
    }
    if(n==2){
        return 1;
    }
    int sum= 0;
    int a=0;
    int b=1;
    for (int i = 2; i <n; i++) {
        sum =a+b;
        a=b;
        b=sum;
    }
    return sum;
}

public  static int getSum(int n){
    int sum = 0;
    for (int i = 1; i <= n; i++) {
        int ret = 1;
        for (int j = 1; j <= i; j++) {
            ret *= j; 
        }
        sum += ret;
    }
    return sum;
}

import java.util.Scanner;
public class Test {
    public static void main(String[] args) {
              System.out.println("請(qǐng)輸入N的值：");
              Scanner scanner =new Scanner(System.in);
              int n= scanner.nextInt();
              System.out.println(function(n));
    }
    public  static int  function( int n){
        if(n==0){
            return 1;
        }
        else
            return n*function(n-1);
    }
}

public static  int[] sort(int arr[]){
    for (int i = 0; i < arr.length-1; i++ ) {
        for (int j = 0;j < arr.length-1-i;j++) {
            if (arr[j] % 2 == 0) {
                int tem = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = tem;
            }
        }
    }
   return arr;
}

public  static int getSum(int i, int j){
    return i+j;
}
public static double getSum(double i,double j,double k){
    return i+j+k;
}