#include <bits/stdc++.h>
using namespace std;
const int N = 2001;
vector<int> v[N << 1];
map<int, int> m;
int n, cnt = 0, l[N], r[N], dp[N << 1][N << 1], mid[N << 1][N << 1],
       w[N << 1][N << 1];
void pre() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    int c, ra;
    cin >> c >> ra;
    l[i] = c - ra;
    r[i] = c + ra;
    m[l[i]] = 1;
    m[r[i]] = 1;
  }
  for (auto x : m) m[x.first] = cnt++;
  for (int i = 0; i < n; i++) {
    l[i] = m[l[i]];
    r[i] = m[r[i]];
    w[l[i]][r[i]] = i + 1;
    v[r[i]].push_back(l[i]);
  }
}
vector<int> ans;
void solve(int l, int r) {
  if (!dp[l][r]) return;
  if (w[l][r]) ans.push_back(w[l][r]);
  if (mid[l][r] == -1) {
    solve(l, r - 1);
    return;
  }
  solve(l, mid[l][r]);
  solve(mid[l][r], r);
}
int main() {
  pre();
  memset(mid, -1, sizeof mid);
  for (int i = 0; i < cnt; i++)
    for (int j = i - 1; j > -1; j--) {
      dp[j][i] = dp[j][i - 1];
      for (auto l : v[i])
        if (l > j && dp[j][i] < dp[j][l] + dp[l][i]) {
          dp[j][i] = dp[j][l] + dp[l][i];
          mid[j][i] = l;
        }
      dp[j][i] += w[j][i] >= 1;
    }
  cout << dp[0][cnt - 1] << endl;
  solve(0, cnt - 1);
  for (auto x : ans) cout << x << ' ';
  cout << endl;
}
