use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn main() { input! { n: i64, } let sq = 2f64.sqrt(); let mut ok = 0f64; let mut ng = 31063f64 + 96955f64 * sq; let up = ng / sq; for _ in 0..100 { let mid = (ok + ng) * 0.5; let mut cnt = 0; for j in 0..=(up as i64) { let j = j as f64; if j * sq <= mid { cnt += (mid - j * sq).floor() as i64 + 1; } } if cnt >= n { ng = mid; } else { ok = mid; } } let mut ans = (1000f64, 0f64, 0f64); for j in 0..=(up as i64) { let j = j as f64; if j * sq <= ok + 0.5 { let i = (ok - j * sq).round(); let d = (ok - j * sq - i).abs(); if d < ans.0 { ans = (d, i, j); } } } println!("{} {}", ans.1 as i64, ans.2 as i64); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ----------