QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#324591#8239. Mysterious Treeucup-team296#AC ✓10ms2272kbRust14.3kb2024-02-10 21:22:202024-02-10 21:22:20

Judging History

This is the latest submission verdict.

  • [2024-02-10 21:22:20]
  • Judged
  • Verdict: AC
  • Time: 10ms
  • Memory: 2272kb
  • [2024-02-10 21:22:20]
  • Submitted

answer

// 
pub mod solution {
//{"name":"j","group":"Manual","url":"","interactive":false,"timeLimit":2000,"tests":[{"input":"","output":""}],"testType":"single","input":{"type":"stdin","fileName":null,"pattern":null},"output":{"type":"stdout","fileName":null,"pattern":null},"languages":{"java":{"taskClass":"j"}}}

use std::io::Write;

#[allow(unused)]
use crate::dbg;
use crate::algo_lib::io::input::Input;
use crate::algo_lib::io::output::Output;

fn solve(input: &mut Input, out: &mut Output, _test_case: usize) {
    let tc = input.usize();
    for _ in 0..tc {
        let n = input.usize();
        let mut ask = |p: usize, q: usize| -> bool {
            let p = (p % n) + 1;
            let q = (q % n) + 1;
            out.println(format!("? {} {}", p, q));
            out.flush();
            input.read::<String>().as_str() == "1"
        };
        const CHAIN: usize = 1;
        const STAR: usize = 2;
        let mut res = CHAIN;
        for start in (0..=n).step_by(2) {
            if ask(start, start + 1) {
                if ask(start, start + 2) {
                    if ask(start, start + 3) {
                        res = STAR;
                    } else {
                        res = CHAIN;
                    }
                } else {
                    if ask(start + 1, start + 2) {
                        if ask(start + 1, start + 3) {
                            res = STAR;
                        } else {
                            res = CHAIN;
                        }
                    } else {
                        res = CHAIN;
                    }
                }
                break;
            }
        }
        out.println(format!("! {}", res));
        out.flush();
    }
}

pub(crate) fn run(mut input: Input, mut output: Output) -> bool {
    solve(&mut input, &mut output, 1);
    output.flush();
    true
}

}
pub mod algo_lib {
pub mod io {
pub mod input {
use std::fmt::Debug;
use std::io::Read;
use std::marker::PhantomData;
use std::path::Path;
use std::str::FromStr;

pub struct Input {
    input: Box<dyn Read>,
    buf: Vec<u8>,
    at: usize,
    buf_read: usize,
}

macro_rules! read_integer_fun {
    ($t:ident) => {
        #[allow(unused)]
        pub fn $t(&mut self) -> $t {
            self.read_integer()
        }
    };
}

impl Input {
    const DEFAULT_BUF_SIZE: usize = 4096;

    ///
    /// Using with stdin:
    /// ```no_run
    /// use algo_lib::io::input::Input;
    /// let stdin = std::io::stdin();
    /// let input = Input::new(Box::new(stdin));
    /// ```
    ///
    /// For read files use ``new_file`` instead.
    ///
    ///
    pub fn new(input: Box<dyn Read>) -> Self {
        Self {
            input,
            buf: vec![0; Self::DEFAULT_BUF_SIZE],
            at: 0,
            buf_read: 0,
        }
    }

    pub fn new_stdin() -> Self {
        let stdin = std::io::stdin();
        Self::new(Box::new(stdin))
    }

    pub fn new_file<P: AsRef<Path>>(path: P) -> Self {
        let file = std::fs::File::open(&path)
            .unwrap_or_else(|_| panic!("Can't open file: {:?}", path.as_ref().as_os_str()));
        Self::new(Box::new(file))
    }

    pub fn new_with_size(input: Box<dyn Read>, buf_size: usize) -> Self {
        Self {
            input,
            buf: vec![0; buf_size],
            at: 0,
            buf_read: 0,
        }
    }

    pub fn new_file_with_size<P: AsRef<Path>>(path: P, buf_size: usize) -> Self {
        let file = std::fs::File::open(&path)
            .unwrap_or_else(|_| panic!("Can't open file: {:?}", path.as_ref().as_os_str()));
        Self::new_with_size(Box::new(file), buf_size)
    }

    pub fn get(&mut self) -> Option<u8> {
        if self.refill_buffer() {
            let res = self.buf[self.at];
            self.at += 1;
            Some(res)
        } else {
            None
        }
    }

    pub fn peek(&mut self) -> Option<u8> {
        if self.refill_buffer() {
            Some(self.buf[self.at])
        } else {
            None
        }
    }

    pub fn skip_whitespace(&mut self) {
        while let Some(b) = self.peek() {
            if !char::from(b).is_whitespace() {
                return;
            }
            self.get();
        }
    }

    pub fn next_token(&mut self) -> Option<Vec<u8>> {
        self.skip_whitespace();
        let mut res = Vec::new();
        while let Some(c) = self.get() {
            if char::from(c).is_whitespace() {
                break;
            }
            res.push(c);
        }
        if res.is_empty() {
            None
        } else {
            Some(res)
        }
    }

    //noinspection RsSelfConvention
    pub fn is_exhausted(&mut self) -> bool {
        self.peek().is_none()
    }

    pub fn has_more_elements(&mut self) -> bool {
        !self.is_exhausted()
    }

    pub fn read<T: Readable>(&mut self) -> T {
        T::read(self)
    }

    pub fn vec<T: Readable>(&mut self, size: usize) -> Vec<T> {
        let mut res = Vec::with_capacity(size);
        for _ in 0usize..size {
            res.push(self.read());
        }
        res
    }

    pub fn string_vec(&mut self, size: usize) -> Vec<Vec<u8>> {
        let mut res = Vec::with_capacity(size);
        for _ in 0usize..size {
            res.push(self.string());
        }
        res
    }

    pub fn read_line(&mut self) -> String {
        let mut res = String::new();
        while let Some(c) = self.get() {
            if c == b'\n' {
                break;
            }
            if c == b'\r' {
                if self.peek() == Some(b'\n') {
                    self.get();
                }
                break;
            }
            res.push(c.into());
        }
        res
    }

    #[allow(clippy::should_implement_trait)]
    pub fn into_iter<T: Readable>(self) -> InputIterator<T> {
        InputIterator {
            input: self,
            phantom: Default::default(),
        }
    }

    fn read_integer<T: FromStr>(&mut self) -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let res = self.read_string();
        res.parse::<T>().unwrap()
    }

    fn read_string(&mut self) -> String {
        match self.next_token() {
            None => {
                panic!("Input exhausted");
            }
            Some(res) => unsafe { String::from_utf8_unchecked(res) },
        }
    }

    pub fn string_as_string(&mut self) -> String {
        self.read_string()
    }

    pub fn string(&mut self) -> Vec<u8> {
        self.read_string().into_bytes()
    }

    fn read_char(&mut self) -> char {
        self.skip_whitespace();
        self.get().unwrap().into()
    }

    fn read_float(&mut self) -> f64 {
        self.read_string().parse().unwrap()
    }

    pub fn f64(&mut self) -> f64 {
        self.read_float()
    }

    fn refill_buffer(&mut self) -> bool {
        if self.at == self.buf_read {
            self.at = 0;
            self.buf_read = self.input.read(&mut self.buf).unwrap();
            self.buf_read != 0
        } else {
            true
        }
    }

    read_integer_fun!(i32);
    read_integer_fun!(i64);
    read_integer_fun!(i128);
    read_integer_fun!(u32);
    read_integer_fun!(u64);
    read_integer_fun!(usize);
}

pub trait Readable {
    fn read(input: &mut Input) -> Self;
}

impl Readable for String {
    fn read(input: &mut Input) -> Self {
        input.read_string()
    }
}

impl Readable for char {
    fn read(input: &mut Input) -> Self {
        input.read_char()
    }
}

impl Readable for f64 {
    fn read(input: &mut Input) -> Self {
        input.read_string().parse().unwrap()
    }
}

impl Readable for f32 {
    fn read(input: &mut Input) -> Self {
        input.read_string().parse().unwrap()
    }
}

impl<T: Readable> Readable for Vec<T> {
    fn read(input: &mut Input) -> Self {
        let size = input.read();
        input.vec(size)
    }
}

pub struct InputIterator<T: Readable> {
    input: Input,
    phantom: PhantomData<T>,
}

impl<T: Readable> Iterator for InputIterator<T> {
    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        self.input.skip_whitespace();
        self.input.peek().map(|_| self.input.read())
    }
}

macro_rules! read_integer {
    ($t:ident) => {
        impl Readable for $t {
            fn read(input: &mut Input) -> Self {
                input.read_integer()
            }
        }
    };
}

read_integer!(i8);
read_integer!(i16);
read_integer!(i32);
read_integer!(i64);
read_integer!(i128);
read_integer!(isize);
read_integer!(u8);
read_integer!(u16);
read_integer!(u32);
read_integer!(u64);
read_integer!(u128);
read_integer!(usize);
}
pub mod output {
use std::io::Write;

pub struct Output {
    output: Box<dyn Write>,
    buf: Vec<u8>,
    at: usize,
    auto_flush: bool,
}

impl Output {
    const DEFAULT_BUF_SIZE: usize = 4096;

    pub fn new(output: Box<dyn Write>) -> Self {
        Self {
            output,
            buf: vec![0; Self::DEFAULT_BUF_SIZE],
            at: 0,
            auto_flush: false,
        }
    }

    pub fn new_stdout() -> Self {
        let stdout = std::io::stdout();
        Self::new(Box::new(stdout))
    }

    pub fn new_file(path: impl AsRef<std::path::Path>) -> Self {
        let file = std::fs::File::create(path).unwrap();
        Self::new(Box::new(file))
    }

    pub fn new_with_auto_flush(output: Box<dyn Write>) -> Self {
        Self {
            output,
            buf: vec![0; Self::DEFAULT_BUF_SIZE],
            at: 0,
            auto_flush: true,
        }
    }

    pub fn flush(&mut self) {
        if self.at != 0 {
            self.output.write_all(&self.buf[..self.at]).unwrap();
            self.at = 0;
            self.output.flush().expect("Couldn't flush output");
        }
    }

    pub fn print<T: Writable>(&mut self, s: T) {
        s.write(self);
    }

    pub fn println<T: Writable>(&mut self, s: T) {
        s.write(self);
        self.put(b'\n');
    }

    pub fn put(&mut self, b: u8) {
        self.buf[self.at] = b;
        self.at += 1;
        if self.at == self.buf.len() {
            self.flush();
        }
    }

    pub fn maybe_flush(&mut self) {
        if self.auto_flush {
            self.flush();
        }
    }

    pub fn print_per_line<T: Writable>(&mut self, arg: &[T]) {
        for i in arg {
            i.write(self);
            self.put(b'\n');
        }
    }

    pub fn print_iter<T: Writable, I: Iterator<Item = T>>(&mut self, iter: I) {
        let mut first = true;
        for e in iter {
            if first {
                first = false;
            } else {
                self.put(b' ');
            }
            e.write(self);
        }
    }

    pub fn print_iter_ref<'a, T: 'a + Writable, I: Iterator<Item = &'a T>>(&mut self, iter: I) {
        let mut first = true;
        for e in iter {
            if first {
                first = false;
            } else {
                self.put(b' ');
            }
            e.write(self);
        }
    }
}

impl Write for Output {
    fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {
        let mut start = 0usize;
        let mut rem = buf.len();
        while rem > 0 {
            let len = (self.buf.len() - self.at).min(rem);
            self.buf[self.at..self.at + len].copy_from_slice(&buf[start..start + len]);
            self.at += len;
            if self.at == self.buf.len() {
                self.flush();
            }
            start += len;
            rem -= len;
        }
        if self.auto_flush {
            self.flush();
        }
        Ok(buf.len())
    }

    fn flush(&mut self) -> std::io::Result<()> {
        self.flush();
        Ok(())
    }
}

pub trait Writable {
    fn write(&self, output: &mut Output);
}

impl Writable for &str {
    fn write(&self, output: &mut Output) {
        output.write_all(self.as_bytes()).unwrap();
    }
}

impl Writable for String {
    fn write(&self, output: &mut Output) {
        output.write_all(self.as_bytes()).unwrap();
    }
}

impl Writable for char {
    fn write(&self, output: &mut Output) {
        output.put(*self as u8);
    }
}

impl<T: Writable> Writable for [T] {
    fn write(&self, output: &mut Output) {
        output.print_iter_ref(self.iter());
    }
}

impl<T: Writable> Writable for Vec<T> {
    fn write(&self, output: &mut Output) {
        self[..].write(output);
    }
}

macro_rules! write_to_string {
    ($t:ident) => {
        impl Writable for $t {
            fn write(&self, output: &mut Output) {
                self.to_string().write(output);
            }
        }
    };
}

write_to_string!(u8);
write_to_string!(u16);
write_to_string!(u32);
write_to_string!(u64);
write_to_string!(u128);
write_to_string!(usize);
write_to_string!(i8);
write_to_string!(i16);
write_to_string!(i32);
write_to_string!(i64);
write_to_string!(i128);
write_to_string!(isize);
write_to_string!(f32);
write_to_string!(f64);

impl<T: Writable, U: Writable> Writable for (T, U) {
    fn write(&self, output: &mut Output) {
        self.0.write(output);
        output.put(b' ');
        self.1.write(output);
    }
}

impl<T: Writable, U: Writable, V: Writable> Writable for (T, U, V) {
    fn write(&self, output: &mut Output) {
        self.0.write(output);
        output.put(b' ');
        self.1.write(output);
        output.put(b' ');
        self.2.write(output);
    }
}
}
}
pub mod misc {
pub mod dbg_macro {
#[macro_export]
#[allow(unused_macros)]
macro_rules! dbg {
    ($first_val:expr, $($val:expr),+ $(,)?) => {
        eprint!("[{}:{}] {} = {:?}",
                    file!(), line!(), stringify!($first_val), &$first_val);
        ($(eprint!(", {} = {:?}", stringify!($val), &$val)),+,);
        eprintln!();
    };
    ($first_val:expr) => {
        eprintln!("[{}:{}] {} = {:?}",
                    file!(), line!(), stringify!($first_val), &$first_val)
    };
}
}
}
}
fn main() {
    let input = algo_lib::io::input::Input::new_stdin();
    let mut output = algo_lib::io::output::Output::new_stdout();
    crate::solution::run(input, output);
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 2156kb

input:

2
4
1
0
1
0
4
0
1
1
1

output:

? 1 2
? 1 3
? 2 3
? 2 4
! 1
? 1 2
? 3 4
? 3 1
? 3 2
! 2

result:

ok Correct (2 test cases)

Test #2:

score: 0
Accepted
time: 3ms
memory: 2152kb

input:

87
13
0
0
0
0
0
1
0
1
1
15
0
0
0
0
0
0
1
1
1
7
0
0
0
1
1
1
15
0
0
0
1
0
0
19
0
0
0
0
0
1
1
1
20
0
0
0
0
0
0
0
0
0
0
0
7
0
0
1
0
1
1
20
0
0
0
0
0
0
0
1
1
1
17
0
0
0
0
0
0
0
0
0
11
1
0
0
14
0
0
0
0
0
0
0
0
13
0
0
0
0
0
0
0
18
0
0
0
0
0
1
0
1
1
14
0
1
0
1
1
20
0
0
0
0
1
0
0
11
0
0
0
1
0
0
11
0
1
0
0
8
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 11 13
? 12 13
? 12 1
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 13 15
? 13 1
! 2
? 1 2
? 3 4
? 5 6
? 7 1
? 7 2
? 7 3
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 7 9
? 8 9
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 11 13
? 11 14
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 1...

result:

ok Correct (87 test cases)

Test #3:

score: 0
Accepted
time: 5ms
memory: 2156kb

input:

135
9
1
0
0
6
0
0
0
0
11
0
0
0
0
1
0
1
0
4
1
1
0
10
0
0
0
0
1
1
1
9
0
0
0
1
1
1
9
0
0
1
0
1
1
6
0
0
0
0
9
0
0
0
1
1
1
11
0
0
0
0
1
0
0
4
0
0
0
4
1
1
1
8
0
0
0
0
0
5
0
0
0
7
1
1
0
11
0
0
0
0
1
0
1
1
4
1
1
1
6
1
1
1
9
0
0
1
1
1
4
1
0
1
1
8
1
0
0
9
0
0
1
0
1
1
7
0
0
1
0
0
4
1
1
1
8
0
0
0
0
0
11
0
0
0
0...

output:

? 1 2
? 1 3
? 2 3
! 1
? 1 2
? 3 4
? 5 6
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 11
? 10 11
? 10 1
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 1
? 9 2
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 7 9
? 7 1
! 2
? 1 2
? 3 4
? 5 6
? 5 7
? 6 7
? 6 8
! 2
? 1 2
? 3 4
? 5 6
? 1 2
! 1
? 1 2
? 3 4
? 5 ...

result:

ok Correct (135 test cases)

Test #4:

score: 0
Accepted
time: 2ms
memory: 2080kb

input:

136
8
0
0
0
1
0
1
1
5
1
0
1
1
11
0
0
1
0
1
0
10
1
0
0
6
0
0
0
0
9
0
0
1
0
1
1
7
0
1
1
1
10
0
0
1
0
1
1
7
0
0
1
1
1
9
0
0
1
1
1
5
0
0
1
1
1
7
0
0
0
1
0
0
10
0
0
1
0
1
1
6
0
1
0
0
6
0
0
1
0
1
0
6
0
1
0
1
1
10
0
1
1
1
9
0
0
1
1
1
5
0
1
1
1
6
0
0
1
1
1
4
0
0
0
5
0
1
1
1
4
1
0
1
1
7
0
0
0
1
1
1
10
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 7 1
? 8 1
? 8 2
! 2
? 1 2
? 1 3
? 2 3
? 2 4
! 2
? 1 2
? 3 4
? 5 6
? 5 7
? 6 7
? 6 8
! 1
? 1 2
? 1 3
? 2 3
! 1
? 1 2
? 3 4
? 5 6
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 5 7
? 6 7
? 6 8
! 2
? 1 2
? 3 4
? 3 5
? 3 6
! 2
? 1 2
? 3 4
? 5 6
? 5 7
? 6 7
? 6 8
! 2
? 1 2
? 3 4
? 5 6
? 5 7
? 5 ...

result:

ok Correct (136 test cases)

Test #5:

score: 0
Accepted
time: 0ms
memory: 2152kb

input:

5
100
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
758
0
0
0
0
0
0
0
0
0
1
0
1
1
70
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
65
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
5
0
0
1
1
1

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (5 test cases)

Test #6:

score: 0
Accepted
time: 1ms
memory: 2208kb

input:

7
147
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
801
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
27
0
0
0
0
0
0
0
0...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (7 test cases)

Test #7:

score: 0
Accepted
time: 0ms
memory: 2148kb

input:

160
4
0
0
0
9
0
0
0
0
0
7
0
0
0
1
1
1
4
0
0
0
9
0
0
0
0
1
1
1
9
0
0
0
0
1
1
1
6
0
0
1
0
1
1
7
0
0
0
1
1
1
4
0
0
0
6
0
0
1
0
1
1
4
0
0
0
5
0
0
1
1
1
7
0
0
0
1
1
1
4
0
1
0
1
1
7
0
0
0
0
6
0
0
0
0
9
0
0
0
0
0
9
0
0
0
0
0
4
0
0
0
4
0
0
0
4
0
0
0
5
0
0
1
1
1
9
0
0
0
0
0
6
0
0
0
0
9
0
0
0
0
0
5
0
0
1
1
1
...

output:

? 1 2
? 3 4
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 1
! 1
? 1 2
? 3 4
? 5 6
? 7 1
? 7 2
? 7 3
! 2
? 1 2
? 3 4
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 1
? 9 2
? 9 3
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 1
? 9 2
? 9 3
! 2
? 1 2
? 3 4
? 5 6
? 5 1
? 6 1
? 6 2
! 2
? 1 2
? 3 4
? 5 6
? 7 1
? 7 2
? 7 3
! 2
? 1 2
? 3 ...

result:

ok Correct (160 test cases)

Test #8:

score: 0
Accepted
time: 0ms
memory: 2212kb

input:

117
6
0
0
0
0
7
0
0
0
0
11
0
0
0
0
0
1
1
1
4
0
0
0
11
0
0
0
0
0
0
5
0
0
1
1
1
10
0
0
0
0
0
0
9
0
0
0
0
1
1
1
10
0
0
0
0
1
0
1
1
11
0
0
0
0
0
0
9
0
0
0
0
0
13
0
0
0
0
0
0
0
11
0
0
0
0
0
0
13
0
0
0
0
0
0
0
8
0
0
0
1
0
1
1
13
0
0
0
0
0
0
0
11
0
0
0
0
0
1
1
1
11
0
0
0
0
0
0
11
0
0
0
0
0
0
8
0
0
0
0
0
6
...

output:

? 1 2
? 3 4
? 5 6
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 1
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 1
? 11 2
? 11 3
! 2
? 1 2
? 3 4
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 1
! 1
? 1 2
? 3 4
? 5 1
? 5 2
? 5 3
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 1
? 9 2
? 9 3
! 2
? 1...

result:

ok Correct (117 test cases)

Test #9:

score: 0
Accepted
time: 10ms
memory: 2272kb

input:

99
14
0
0
0
0
0
0
1
0
1
1
6
0
0
1
0
1
1
13
0
0
0
0
0
0
0
4
0
0
0
14
0
0
0
0
0
0
0
0
11
0
0
0
0
0
0
11
0
0
0
0
0
0
11
0
0
0
0
0
1
1
1
15
0
0
0
0
0
0
0
1
1
1
4
0
0
0
12
0
0
0
0
0
0
0
14
0
0
0
0
0
0
1
0
1
1
13
0
0
0
0
0
0
1
1
1
9
0
0
0
0
1
1
1
8
0
0
0
0
0
7
0
0
0
0
7
0
0
0
1
1
1
4
0
0
0
8
0
0
0
1
0
1
1...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 13 1
? 14 1
? 14 2
! 2
? 1 2
? 3 4
? 5 6
? 5 1
? 6 1
? 6 2
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 1
! 1
? 1 2
? 3 4
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 1
! 1
? 1 2
? 3 4
? 5 6...

result:

ok Correct (99 test cases)

Test #10:

score: 0
Accepted
time: 2ms
memory: 2104kb

input:

84
18
0
0
0
0
0
0
0
0
0
0
14
0
0
0
0
0
0
0
0
17
0
0
0
0
0
0
0
0
1
1
1
13
0
0
0
0
0
0
0
11
0
0
0
0
0
1
1
1
7
0
0
0
0
14
0
0
0
0
0
0
0
0
12
0
0
0
0
0
0
0
17
0
0
0
0
0
0
0
0
1
1
1
6
0
0
0
0
9
0
0
0
0
0
10
0
0
0
0
1
0
1
1
5
0
0
1
1
1
4
0
0
0
6
0
0
0
0
15
0
0
0
0
0
0
0
0
4
0
0
0
17
0
0
0
0
0
0
0
0
1
1
1
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 1
? 17 2
? 17 3
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 1
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 1
? ...

result:

ok Correct (84 test cases)

Test #11:

score: 0
Accepted
time: 0ms
memory: 2016kb

input:

23
27
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
12
0
0
0
0
0
0
0
93
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
100
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
1
1
6
0
0
0
0
59
0
0
0
0
0
0
0
0
0
0
0
0
0...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 1
? 27 2
? 27 3
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 1 2
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35...

result:

ok Correct (23 test cases)

Test #12:

score: 0
Accepted
time: 0ms
memory: 2112kb

input:

20
39
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
44
0
0
0
0
0
0
0
0
0
0
0
0
1
0
1
1
85
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
1
1
35
0
0
0
0
0
0
0
0
0
1
0
1
1
94
0
0
0
0
0
0
0
0
0
1
0
0
92
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 37 39
? 37 1
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 25 27
? 26 27
? 26 28
! 2
? 1 2
? 3 4
? 5...

result:

ok Correct (20 test cases)

Test #13:

score: 0
Accepted
time: 3ms
memory: 2140kb

input:

9
69
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
189
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
72
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 1
! 1
? 1 2
? 3 4
? 5 6
? 7 8
? ...

result:

ok Correct (9 test cases)

Test #14:

score: 0
Accepted
time: 3ms
memory: 2152kb

input:

6
243
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
181
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (6 test cases)

Test #15:

score: 0
Accepted
time: 0ms
memory: 2020kb

input:

4
613
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (4 test cases)

Test #16:

score: 0
Accepted
time: 0ms
memory: 2040kb

input:

146
6
1
1
0
9
1
1
0
4
1
1
1
9
1
1
1
7
1
1
0
6
1
1
1
5
1
1
0
9
1
1
1
7
1
1
0
4
1
1
1
9
1
1
1
5
1
1
1
4
1
1
1
9
1
1
1
5
1
1
0
4
1
1
1
9
1
1
0
6
1
1
1
5
1
1
0
9
1
1
1
6
1
1
1
5
1
1
0
7
1
1
0
5
1
1
1
5
1
1
1
5
1
1
1
7
1
1
1
4
1
1
0
4
1
1
1
6
1
1
0
8
1
1
0
7
1
1
0
5
1
1
0
9
1
1
0
7
1
1
1
8
1
1
0
6
1
1
1
...

output:

? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? ...

result:

ok Correct (146 test cases)

Test #17:

score: 0
Accepted
time: 4ms
memory: 2156kb

input:

117
4
1
1
1
4
1
1
1
12
1
1
1
7
1
1
1
12
1
1
1
9
1
1
1
10
1
1
1
13
1
1
1
11
1
1
1
9
1
1
0
12
1
1
1
11
1
1
0
4
1
1
0
10
1
1
1
5
1
1
1
5
1
1
1
5
1
1
1
4
1
1
0
4
1
1
1
7
1
1
0
4
1
1
1
8
1
1
1
7
1
1
0
6
1
1
1
7
1
1
0
13
1
1
1
10
1
1
1
12
1
1
1
9
1
1
1
4
1
1
1
9
1
1
0
7
1
1
1
6
1
1
1
11
1
1
1
8
1
1
0
13
1...

output:

? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? ...

result:

ok Correct (117 test cases)

Test #18:

score: 0
Accepted
time: 1ms
memory: 2076kb

input:

105
7
1
1
0
11
1
1
1
13
1
1
0
12
1
1
1
6
1
1
1
10
1
1
1
7
1
1
0
4
1
1
0
13
1
1
1
13
1
1
1
14
1
1
0
5
1
1
1
6
1
1
1
4
1
1
1
6
1
1
1
6
1
1
0
10
1
1
1
15
1
1
1
6
1
1
0
9
1
1
0
13
1
1
0
15
1
1
1
5
1
1
1
11
1
1
0
6
1
1
0
7
1
1
1
10
1
1
0
15
1
1
1
12
1
1
0
7
1
1
1
12
1
1
0
12
1
1
1
6
1
1
1
4
1
1
1
6
1
1
1...

output:

? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? ...

result:

ok Correct (105 test cases)

Test #19:

score: 0
Accepted
time: 4ms
memory: 2264kb

input:

86
12
1
1
1
17
1
1
1
7
1
1
1
6
1
1
0
13
1
1
1
5
1
1
1
16
1
1
0
6
1
1
1
10
1
1
0
18
1
1
1
4
1
1
1
19
1
1
1
14
1
1
1
13
1
1
1
4
1
1
1
5
1
1
0
8
1
1
1
13
1
1
0
15
1
1
1
7
1
1
0
20
1
1
0
20
1
1
0
5
1
1
1
6
1
1
0
5
1
1
0
15
1
1
0
12
1
1
1
9
1
1
1
17
1
1
0
19
1
1
1
20
1
1
1
11
1
1
0
20
1
1
0
14
1
1
1
18
1...

output:

? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? ...

result:

ok Correct (86 test cases)

Test #20:

score: 0
Accepted
time: 1ms
memory: 2152kb

input:

20
53
1
1
0
61
1
1
1
96
1
1
1
60
1
1
1
25
1
1
1
18
1
1
1
24
1
1
1
73
1
1
1
76
1
1
0
62
1
1
0
33
1
1
1
89
1
1
0
55
1
1
0
71
1
1
0
45
1
1
1
44
1
1
1
52
1
1
1
46
1
1
0
7
1
1
0
7
1
1
1

output:

? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? ...

result:

ok Correct (20 test cases)

Test #21:

score: 0
Accepted
time: 0ms
memory: 2200kb

input:

9
273
1
1
0
54
1
1
0
234
1
1
1
256
1
1
1
70
1
1
1
23
1
1
0
5
1
1
0
81
1
1
1
4
1
1
1

output:

? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2

result:

ok Correct (9 test cases)

Test #22:

score: 0
Accepted
time: 0ms
memory: 2044kb

input:

12
92
1
1
1
50
1
1
1
395
1
1
0
152
1
1
1
31
1
1
1
183
1
1
1
13
1
1
1
32
1
1
1
21
1
1
0
12
1
1
0
14
1
1
0
4
1
1
1

output:

? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2

result:

ok Correct (12 test cases)

Test #23:

score: 0
Accepted
time: 0ms
memory: 2204kb

input:

5
957
1
1
0
14
1
1
0
7
1
1
1
10
1
1
1
11
1
1
0

output:

? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1

result:

ok Correct (5 test cases)

Test #24:

score: 0
Accepted
time: 1ms
memory: 2212kb

input:

81
11
1
1
0
20
1
1
1
5
1
0
1
1
16
0
0
0
0
0
0
1
0
0
19
0
1
1
1
17
1
0
1
1
12
1
1
1
4
1
1
1
13
0
0
1
0
1
0
20
0
0
1
0
1
1
10
1
0
1
1
20
1
1
0
8
1
1
1
5
0
0
0
11
1
1
0
17
0
1
1
1
9
1
1
0
13
0
1
1
1
19
0
1
0
1
1
13
0
0
1
0
0
17
0
0
0
0
0
0
0
0
1
1
1
18
1
1
1
12
1
0
0
19
1
1
1
18
0
0
0
0
0
0
0
0
0
0
8
1...

output:

? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 2 3
? 2 4
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 13 15
? 14 15
! 1
? 1 2
? 3 4
? 3 5
? 3 6
! 2
? 1 2
? 1 3
? 2 3
? 2 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 3 4
? 5 6
? 5 7
? 6 7
? 6 8
! 1
? 1 2
? 3 4
? 5 6
? 5...

result:

ok Correct (81 test cases)

Test #25:

score: 0
Accepted
time: 1ms
memory: 2084kb

input:

24
43
1
1
1
87
1
1
1
19
0
1
1
1
23
0
0
0
1
0
0
13
0
1
1
0
75
1
1
0
13
0
1
0
1
1
85
1
0
1
1
31
1
1
1
24
1
0
1
1
68
1
1
0
94
1
1
1
11
0
0
0
0
0
0
33
1
1
1
80
0
0
0
0
1
0
1
1
85
1
0
1
1
74
0
0
1
0
1
0
42
1
0
1
0
65
0
0
0
0
0
1
0
1
1
13
0
0
0
0
0
0
1
0
0
5
1
1
1
7
0
0
0
1
1
1
4
0
1
1
1
5
0
0
1
1
1

output:

? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 3 4
? 3 5
? 3 6
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 7 9
? 8 9
! 1
? 1 2
? 3 4
? 3 5
? 3 6
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 3 4
? 3 5
? 4 5
? 4 6
! 2
? 1 2
? 1 3
? 2 3
? 2 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 2 3
? 2 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 ...

result:

ok Correct (24 test cases)

Test #26:

score: 0
Accepted
time: 1ms
memory: 2068kb

input:

9
35
0
0
0
0
1
0
0
122
1
1
1
167
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
288
0
1
1
1
173
1
0
1
0
45
1
1
1
99
0
0
1
0
1
1
64
0
0
0
0
0
0
0
0
0
1
0
1
1
5
0
0
0

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 11
? 10 11
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 51 53
? 52 53
! 1
? 1 2
? 3...

result:

ok Correct (9 test cases)

Test #27:

score: 0
Accepted
time: 1ms
memory: 2220kb

input:

8
481
0
0
0
0
1
0
1
1
165
0
0
0
0
1
0
1
1
11
0
0
1
0
0
145
0
1
1
0
34
1
0
0
148
1
1
1
12
1
1
0
4
0
1
1
1

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 11
? 10 11
? 10 12
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 11
? 10 11
? 10 12
! 2
? 1 2
? 3 4
? 5 6
? 5 7
? 6 7
! 1
? 1 2
? 3 4
? 3 5
? 3 6
! 1
? 1 2
? 1 3
? 2 3
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 3 4
? 3 1
? 3 2
! 2

result:

ok Correct (8 test cases)

Test #28:

score: 0
Accepted
time: 1ms
memory: 2140kb

input:

10
510
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
222
1
1
0
115
1
1
0
20
1
1
1
37
1
1
1
10
0
1
0
0
19
1
1
1
22
0
1
0
0
36
1
1
1
7
0
0
0
1
1
0

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 25 27
? 26 27
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 3 4
? 3 5
? 4 5
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 3 4
? 3 5
? 4 5
! 1
? 1 2
? 1 3
? 1 4
!...

result:

ok Correct (10 test cases)

Test #29:

score: 0
Accepted
time: 1ms
memory: 2092kb

input:

1
1000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (1 test case)

Test #30:

score: 0
Accepted
time: 1ms
memory: 2212kb

input:

2
500
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (2 test cases)

Test #31:

score: 0
Accepted
time: 0ms
memory: 2076kb

input:

4
250
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
250
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 75 ...

result:

ok Correct (4 test cases)

Test #32:

score: 0
Accepted
time: 0ms
memory: 2076kb

input:

1
1000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (1 test case)

Test #33:

score: 0
Accepted
time: 0ms
memory: 2144kb

input:

1
1000
1
1
1

output:

? 1 2
? 1 3
? 1 4
! 2

result:

ok Correct (1 test case)

Test #34:

score: 0
Accepted
time: 0ms
memory: 2152kb

input:

1
1000
0
0
0
0
1
0
1
1

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 11
? 10 11
? 10 12
! 2

result:

ok Correct (1 test case)

Test #35:

score: 0
Accepted
time: 0ms
memory: 2268kb

input:

2
500
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (2 test cases)

Test #36:

score: 0
Accepted
time: 0ms
memory: 2080kb

input:

2
500
1
1
1
500
1
1
0

output:

? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1

result:

ok Correct (2 test cases)

Test #37:

score: 0
Accepted
time: 0ms
memory: 2156kb

input:

2
500
1
1
1
500
0
1
0
1
1

output:

? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 3 4
? 3 5
? 4 5
? 4 6
! 2

result:

ok Correct (2 test cases)

Test #38:

score: 0
Accepted
time: 0ms
memory: 2040kb

input:

4
250
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
1
1
250
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (4 test cases)

Test #39:

score: 0
Accepted
time: 0ms
memory: 2156kb

input:

4
250
1
1
0
250
1
1
0
250
1
1
1
250
1
1
0

output:

? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 1
? 1 2
? 1 3
? 1 4
! 2
? 1 2
? 1 3
? 1 4
! 1

result:

ok Correct (4 test cases)

Test #40:

score: 0
Accepted
time: 0ms
memory: 2064kb

input:

4
250
0
0
0
0
1
0
1
1
250
0
0
0
0
1
0
1
1
250
0
0
1
1
0
250
0
0
1
0
1
1

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 11
? 10 11
? 10 12
! 2
? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 9 11
? 10 11
? 10 12
! 2
? 1 2
? 3 4
? 5 6
? 5 7
? 5 8
! 1
? 1 2
? 3 4
? 5 6
? 5 7
? 6 7
? 6 8
! 2

result:

ok Correct (4 test cases)

Test #41:

score: 0
Accepted
time: 2ms
memory: 2084kb

input:

1
1000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0...

output:

? 1 2
? 3 4
? 5 6
? 7 8
? 9 10
? 11 12
? 13 14
? 15 16
? 17 18
? 19 20
? 21 22
? 23 24
? 25 26
? 27 28
? 29 30
? 31 32
? 33 34
? 35 36
? 37 38
? 39 40
? 41 42
? 43 44
? 45 46
? 47 48
? 49 50
? 51 52
? 53 54
? 55 56
? 57 58
? 59 60
? 61 62
? 63 64
? 65 66
? 67 68
? 69 70
? 71 72
? 73 74
? 75 76
? 77 ...

result:

ok Correct (1 test case)

Extra Test:

score: 0
Extra Test Passed