fn main() {
  let n: u64 = read();
  let c = Combination::new(n);
  
  let ans = (1..n+1).map(|r|c.comb(r)*modulo::pow(r,n-r)).fold(0,|a,x|modulo::plus(a,x));
  println!("{}", ans);
}

fn read<T: std::str::FromStr>() -> T {
  let mut buf = String::new();
  std::io::stdin().read_line(&mut buf).ok();
  buf.trim().parse::<T>().ok().unwrap()
}
  
struct Combination {
  n: u64,
  fact_table: Vec<u64>
}

impl Combination {
  fn new(n: u64) -> Combination {
    Combination {
      n: n,
      fact_table: (1..n+1).scan(1,|a,x|{*a=modulo::mul(*a,x); Some(*a)}).collect::<Vec<_>>()
    }
  }

  fn comb(&self, r: u64) -> u64 {
    match r {
      _ if self.n < r => 0,
      _ if self.n == r => 1,
      _ => {
        let a = self.fact_table[self.n as usize - 1];
        let b = modulo::pow(self.fact_table[r as usize - 1], modulo::MOD-2);
        let c = modulo::pow(self.fact_table[(self.n - r) as usize - 1], modulo::MOD-2);
        [a,b,c].iter().fold(1, |a,&x| modulo::mul(a,x))
      }
    }
  }
}
  
mod modulo {
  pub const MOD: u64 = 1_000_000_007;
  
  pub fn plus(x: u64, y: u64) -> u64 {
    (x + y) % MOD
  }

  pub fn mul(x: u64, y: u64) -> u64 {
    (x * y) % MOD
  }
  
  pub fn pow(x: u64, n: u64) -> u64 {
    match n {
      0 => 1,
      _ if n % 2 == 1 => mul(x, pow(x, n-1)),
      _ => {
        let q = pow(x, n>>1);
        mul(q, q)
      }
    }
  }
}