#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn print_array<T: std::string::ToString>(array: &Vec<T>) {
    println!(
        "{}",
        array
            .iter()
            .map(|ref x| x.to_string())
            .collect::<Vec<_>>()
            .join(" ")
    );
}

fn query(a: &BTreeSet<usize>) -> i32 {
    let a = a.into_iter().map(|x| x + 1).collect::<Vec<_>>();
    print!("? ");
    print_array(&a);
    read::<i32>()
}

fn main() {
    let n = read::<usize>();
    let mut decided: Vec<usize> = vec![];
    let mut not_decided = (0..n).collect::<Vec<_>>();
    // let criterion =
    loop {
        let (ok, _) = binary_search(-1, not_decided.len() as i32 + 1, |x: i32| {
            if x == -1 {
                return true;
            }
            if x == decided.len() as i32 + 1 {
                return false;
            }
            let mut query_numbers = not_decided
                .iter()
                .cloned()
                .take(x as usize + 1)
                .collect::<BTreeSet<_>>();
            for &num in decided.iter() {
                query_numbers.insert(num);
            }
            query(&query_numbers) == 0
        });
        if ok == -1 {
            break;
        }
        decided.push(not_decided[ok as usize]);
        not_decided.remove(ok as usize);
        if not_decided.is_empty() {
            break;
        }
    }

    decided.sort();
    let decided = decided.iter().map(|&x| x + 1).collect::<Vec<_>>();
    println!("! {}", decided.len());
    print_array(&decided);
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
fn binary_search<F>(lb: i32, ub: i32, criterion: F) -> (i32, i32)
where
    F: Fn(i32) -> bool,
{
    let mut ok = lb;
    let mut ng = ub;
    while ng - ok > 1 {
        let mid = (ng + ok) / 2;
        if criterion(mid) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    (ok, ng)
}