// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] // use core::num; use std::cmp::*; use std::fmt::*; use std::hash::*; use std::io::BufRead; use std::iter::FromIterator; use std::*; use std::{cmp, collections, fmt, io, iter, ops, str}; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; const LINF: i64 = 2147483647; const INF128: i128 = 1223372036854775807000000000000; const MOD1: i64 = 1000000007; const MOD9: i64 = 998244353; const MOD: i64 = MOD9; // const MOD: i64 = MOD2; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; // use proconio::input; // const MOD: i64 = INF; use cmp::Ordering::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; macro_rules! p { ($x:expr) => { //if expr println!("{}", $x); }; } macro_rules! vp { // vector print sd1arate with space ($x:expr) => { println!( "{}", $x.iter() .map(|x| x.to_string()) .collect::>() .join(" ") ); }; } macro_rules! d { ($x:expr) => { println!("{:?}", $x); }; } macro_rules! yn { ($val:expr) => { if $val { println!("Yes"); } else { println!("No"); } }; } macro_rules! map{ // declear btreemap ($($key:expr => $val:expr),*) => { { let mut map = ::std::collections::BTreeMap::new(); $( map.insert($key, $val); )* map } }; } macro_rules! set{ // declear btreemap ($($key:expr),*) => { { let mut set = ::std::collections::BTreeSet::new(); $( set.insert($key); )* set } }; } //input output #[allow(dead_code)] fn read() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } #[allow(dead_code)] fn read_vec() -> Vec { read::() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[allow(dead_code)] fn read_mat(n: u32) -> Vec> { (0..n).map(|_| read_vec()).collect() } #[allow(dead_code)] fn readii() -> (i64, i64) { let mut vec: Vec = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut vec: Vec = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut vec: Vec = read_vec(); (vec[0], vec[1]) } #[allow(dead_code)] fn readff() -> (f64, f64) { let mut vec: Vec = read_vec(); (vec[0], vec[1]) } fn readcc() -> (char, char) { let mut vec: Vec = read_vec(); (vec[0], vec[1]) } fn readuuu() -> (usize, usize, usize) { let mut vec: Vec = read_vec(); (vec[0], vec[1], vec[2]) } #[allow(dead_code)] fn readiiii() -> (i64, i64, i64, i64) { let mut vec: Vec = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut vec: Vec = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } fn main() { let mut s = String::new(); io::stdin().read_line(&mut s).unwrap(); let s = s.trim(); if let Some(ans) = solve(s) { println!("{}", ans); } } fn solve(s: &str) -> Option { let d: Vec<_> = s.bytes().map(|b| (b - b'0') as usize).collect(); let mut pm = vec![0]; let mut ph = vec![false]; for &x in &d { pm.push((pm.last().unwrap() + x) % 3); ph.push(*ph.last().unwrap() || x == 3); } // sがナベアツ数じゃないならその数字を返す // d!((pm.clone(), ph.clone())); if pm.last().unwrap() != &0 && !*ph.last().unwrap() { return Some(s.to_string()); } let l = d.len(); if l == 1 { let n = d[0]; for x in (1..=n).rev() { if x % 3 != 0 && !x.to_string().contains('3') { return Some(x.to_string()); } } } for pos in (0..l).rev() { if ph[pos] { continue; } for c in (0..d[pos]).rev() { if c == 3 || (pos == 0 && c == 0) { continue; } let sm = (pm[pos] + c) % 3; let k = l - pos - 1; if sm == 0 && k == 0 { continue; } let suf = if k == 0 { String::new() } else if sm != 0 { "9".repeat(k) } else if k == 1 { "8".into() } else { format!("{}8", "9".repeat(k - 1)) }; let mut ans = s[..pos].to_string(); ans.push(char::from_digit(c as u32, 10).unwrap()); ans.push_str(&suf); return Some(ans); } } let k = l - 1; Some(if k == 1 { "8".into() } else { format!("{}8", "9".repeat(k - 1)) }) }