#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a[105], b[105], i, j, ans, maxx;
  ;
  while (~scanf("%d", &n)) {
    ans = 0;
    maxx = 0;
    memset(b, 0, sizeof(b));
    for (i = 0; i < n; i++) {
      scanf("%d", &a[i]);
      maxx = maxx > a[i] ? maxx : a[i];
    }
    for (i = 1; i <= maxx; i++) {
      for (j = 0; j < n; j++) {
        if (a[j] == i) {
          a[j] = 0;
          b[ans++] = 2000 + j + 1;
          break;
        } else
          a[j] = 0;
      }
    }
    if (ans == 0)
      puts("0");
    else {
      printf("%d\n", ans);
      for (int i = 0; i < ans - 1; i++) printf("%d ", b[i]);
      printf("%d\n", b[ans - 1]);
    }
  }
  return 0;
}
