#![allow(unused)] use kyoproio::*; use std::{ collections::*, io::{self, prelude::*}, iter, mem::{replace, swap}, }; fn main() -> io::Result<()> { std::thread::Builder::new() .stack_size(10 * 1024 * 1024) .spawn(solve)? .join() .unwrap(); Ok(()) } fn solve() { let stdin = io::stdin(); let mut kin = KInput::new(stdin.lock()); let stdout = io::stdout(); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+) }; } macro_rules! outputln { ($($args:expr),+) => { output!($($args),+); outputln!(); }; () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } } } const MOD: i64 = 129402307; let mut f = |m| { let mut n = 0; for &b in kin.bytes() { n = (10 * n + (b - b'0') as i64) % m; } n }; let n = f(MOD); let m = f(MOD - 1); outputln!("{}", mod_pow(n, m, MOD)); } pub fn mod_pow(mut a: i64, mut b: i64, m: i64) -> i64 { let mut y = 1; while b > 0 { if b & 1 == 1 { y = y * a % m; } a = a * a % m; b >>= 1; } y } // a^123 // a^(100 + 20 + 3) // a^100 * a^20 * a^3 // 0 1 2 3 4 5 6 7 8 9 10 // 0 1 2 3 0 1 2 3 4 0 1 // ----------------------------------------------------------------------------- pub mod kyoproio { #![warn(unused)] use std::io::prelude::*; pub trait Input { fn str(&mut self) -> &str; fn bytes(&mut self) -> &[u8] { self.str().as_ref() } fn input(&mut self) -> T { T::input(self).expect("input error") } fn iter(&mut self) -> Iter { Iter(self, std::marker::PhantomData) } fn seq>(&mut self, n: usize) -> B { self.iter().take(n).collect() } } pub struct KInput { src: R, buf: String, pos: usize, } impl KInput { pub fn new(src: R) -> Self { Self { src, buf: String::with_capacity(1024), pos: 0, } } } impl Input for KInput { fn str(&mut self) -> &str { loop { if self.pos >= self.buf.len() { self.pos = 0; self.buf.clear(); if self.src.read_line(&mut self.buf).expect("io error") == 0 { return &self.buf; } } let range = self.pos ..self.buf[self.pos..] .find(|c: char| c.is_ascii_whitespace()) .map(|i| i + self.pos) .unwrap_or_else(|| self.buf.len()); self.pos = range.end + 1; if range.end > range.start { return &self.buf[range]; } } } } pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>); impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> { type Item = T; fn next(&mut self) -> Option { Some(self.0.input()) } } pub trait InputParse: Sized { type Err: std::fmt::Debug; fn input(input: &mut I) -> Result; } macro_rules! from_str_impls { { $($T:ty)* } => { $(impl InputParse for $T { type Err = <$T as std::str::FromStr>::Err; fn input(input: &mut I) -> Result { input.str().parse::<$T>() } })* }; } from_str_impls! { String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 } macro_rules! tuple_impls { ($H:ident $($T:ident)*) => { impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) { type Err = std::convert::Infallible; fn input(input: &mut I) -> Result { // ? Ok(($H::input(input).unwrap(), $($T::input(input).unwrap()),*)) } } tuple_impls!($($T)*); }; () => {}; } tuple_impls!(A B C D E F G); }