#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
inline bool isDigit(char c) { return '0' <= c && c <= '9'; }
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isSquare(T x) {
  T y = sqrt(x + 0.5);
  return (y * y) == x;
}
template <class T1, class T2>
inline T1 gcd(T1 a, T2 b) {
  return b ? gcd(b, a % b) : a;
}
template <class T1, class T2>
inline T1 eqMin(T1 &x, const T2 &y) {
  if (T1(y) < x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 eqMax(T1 &x, const T2 &y) {
  if (T1(y) > x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 min(const T1 &x, const T2 &y) {
  return x < (T1)y ? x : (T1)y;
}
template <class T1, class T2>
inline T1 max(T1 &x, const T2 &y) {
  return x > (T1)y ? x : (T1)y;
}
template <typename T>
inline T getint() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') p = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * p;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T>
auto operator<<(ostream &os, const T &v)
    -> decltype(v.begin(), v.end(), declval<ostream &>()) {
  os << '{';
  bool was = false;
  for (const auto &x : v) {
    if (was) os << ", ";
    was = true;
    os << x;
  }
  os << '}';
  return os;
}
template <size_t sz>
ostream &operator<<(ostream &os, const bitset<sz> &bit) {
  os << '/';
  for (int i = 0; i < sz; i++) os << bit[i];
  os << '\\';
  return os;
}
const double PI = acos(-1);
const double EPS = 1e-8;
const int INF = (int)2e9;
const long long LINF = (long long)2e18;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)5000;
int n, ans;
int x[MAXN][2];
vector<int> b, p, ansP;
bool used[MAXN];
inline bool check(const vector<int> &v) {
  memset(used, 0, sizeof(used));
  for (const int it : v) {
    if (used[it]) {
      return false;
    }
    used[it] = true;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  ansP = b = p = vector<int>(n, 0);
  cout.flush();
  for (int i = 0; i < n; i++) {
    int v;
    cout << "? " << 0 << ' ' << i << endl;
    cout.flush();
    cin >> v;
    cout.flush();
    x[i][0] = v;
  }
  for (int i = 0; i < n; i++) {
    int v;
    cout << "? " << i << ' ' << 0 << endl;
    cout.flush();
    cin >> v;
    cout.flush();
    x[i][1] = v;
  }
  for (int val = 0; val < n; val++) {
    b[0] = val;
    p[0] = val ^ x[0][0];
    for (int i = 1; i < n; i++) {
      b[i] = p[0] ^ x[i][0];
    }
    for (int i = 1; i < n; i++) {
      p[i] = b[0] ^ x[i][1];
    }
    bool fl = true;
    for (int i = 0; i < n; i++) {
      if (p[b[i]] != i) {
        fl = false;
        break;
      }
    }
    if (fl) {
      ans++;
      if (ans == 1) {
        ansP = p;
      }
    }
  }
  cout << "!\n";
  cout.flush();
  cout << ans << endl;
  cout.flush();
  for (int it : ansP) {
    cout << it << ' ';
  }
  cout.flush();
}
