#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int a[5050], b[5050], vst[5050], p[5050], q[5050], ans[5050];
int ask(int u, int v) {
  printf("? %d %d\n", u, v);
  fflush(stdout);
  gn(u);
  return u;
}
int main() {
  int n;
  gn(n);
  for (int i = 0; i < n; i++) a[i] = ask(i, i), b[i] = ask(0, i);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    p[0] = i;
    for (int j = 0; j < n; j++) {
      p[j] = b[j] ^ a[j] ^ p[0];
      q[j] = b[j] ^ p[0];
    }
    int ok = 0;
    for (int j = 0; j < n; j++)
      if (p[q[j]] != j) {
        ok = 1;
        break;
      }
    if (ok) continue;
    for (int j = 0; j < n; j++) vst[j] = 0;
    for (int j = 0; j < n; j++) vst[p[j]] = 1;
    ok = 0;
    for (int j = 0; j < n; j++)
      if (vst[j] != 1) {
        ok = 1;
        break;
      }
    if (ok) continue;
    cnt++;
    for (int j = 0; j < n; j++) ans[j] = p[j];
  }
  puts("!");
  printf("%d\n", cnt);
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  puts("");
  fflush(stdout);
  return 0;
}
