#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
  long long gcd = GCD(a, b);
  return (a * b) / gcd;
}
int main() {
  long long i, j = 0, k = 0, n = 0, m = 0, t, x = 1, y = 0, z, s = 0, l;
  cin >> n;
  int a[n];
  for (i = 0; i < n; i++) cin >> a[i];
  vector<int> priya;
  for (i = 0; i < n; i++) {
    if (a[i] == x) {
      priya.push_back(2001 + i);
      x++;
    }
  }
  l = priya.size();
  cout << l << endl;
  for (i = 0; i < l; i++) {
    cout << priya[i] << " ";
  }
}
