#include <bits/stdc++.h>
using namespace std;
int t, n, c, r, s[4005][4005], f[4005][4005], x[4005], g[4005][4005], y[4005],
    d[4005];
vector<int> b[4005];
inline int dfs(int l, int r) {
  if (l > r) return 0;
  if (f[l][r] != -1) return f[l][r];
  f[l][r] = dfs(l + 1, r);
  for (register int k = 0; k < b[l].size(); k++) {
    if (y[b[l][k]] < r && dfs(l, y[b[l][k]]) + dfs(y[b[l][k]], r) > f[l][r]) {
      f[l][r] = f[l][y[b[l][k]]] + f[y[b[l][k]]][r];
      s[l][r] = y[b[l][k]];
    }
  }
  f[l][r] += !!g[l][r];
  return f[l][r];
}
inline void dfs1(int l, int r) {
  if (l > r) return;
  if (s[l][r]) {
    dfs1(l, s[l][r]);
    dfs1(s[l][r], r);
  } else
    dfs1(l + 1, r);
  if (g[l][r]) printf("%d ", g[l][r]);
}
int main() {
  scanf("%d", &n);
  for (register int i = 0; i < n; i++) {
    scanf("%d%d", &c, &r);
    x[i] = c - r;
    y[i] = c + r;
    d[i] = x[i];
    d[i + n] = y[i];
  }
  sort(d, d + n + n);
  t = unique(d, d + n + n) - d;
  for (register int i = 0; i < n; i++) {
    x[i] = upper_bound(d, d + t, x[i]) - d;
    y[i] = upper_bound(d, d + t, y[i]) - d;
    b[x[i]].push_back(i);
    g[x[i]][y[i]] = i + 1;
  }
  memset(f, -1, sizeof(f));
  printf("%d\n", dfs(1, t));
  dfs1(1, t);
  return 0;
}
