use std::collections::{HashMap, HashSet};

fn main() {
    proconio::input! {
        n: u64,
    }
    println!("{}", factorial_mod::<1000000007>(n));
}

// 階乗を求める
fn factorial_mod<const MOD_NUM: u64>(n: u64) -> u64 {
    if n >= MOD_NUM {
        return 0;
    }
    let mut result = 1;
    for i in 1..=n {
        result = (result * i) % MOD_NUM;
    }
    result
}