#include <bits/stdc++.h>
using namespace std;
const int MAX = 4e3 + 9;
const long long MOD = 1e9 + 7;
vector<int> ans;
vector<pair<int, pair<int, int>>> pos;
map<int, int> mp;
int c[MAX], r[MAX], a[MAX], num[MAX], dp[MAX][MAX], way[MAX][MAX];
int f(int x) { return ((x < 0) ? -1 : 1); }
bool cmp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) {
  if (a.first < b.first) return true;
  if (a.first > b.first) return false;
  if (f(a.second.first) < f(b.second.first)) return true;
  if (f(a.second.first) > f(b.second.first)) return false;
  return a.second.second < b.second.second;
}
void print(int l, int r) {
  if (l >= r || dp[l][r] == 0) return;
  int cur = way[l][r];
  if (cur == -1)
    print(l + 1, r);
  else {
    cout << num[l] << " ";
    print(l, a[l] - 1);
    print(a[l], r);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> c[i] >> r[i];
    pos.push_back(make_pair(c[i] - r[i], make_pair(i, -c[i] - r[i])));
    pos.push_back(make_pair(c[i] + r[i], make_pair(-i, r[i] - c[i])));
  }
  sort(pos.begin(), pos.end(), cmp);
  int id = 0;
  for (auto x : pos) {
    id++;
    num[id] = x.second.first;
  }
  int id2 = 0;
  for (auto x : pos) {
    id2++;
    if (x.second.first < 0) continue;
    for (int i = 1; i <= id; i++)
      if (num[i] + x.second.first == 0) a[id2] = i;
  }
  memset(way, -1, sizeof way);
  for (int i = 0; i < MAX; i++) dp[i][i] = 0;
  for (int k = 1; k < MAX; k++)
    for (int i = 1; i + k < MAX; i++) {
      int l = i;
      int r = i + k;
      dp[l][r] = dp[l + 1][r];
      if (a[l] && a[l] <= r) {
        int f = 1 + dp[l][a[l] - 1] + dp[a[l]][r];
        dp[l][r] = max(dp[l][r], f);
        if (dp[l][r] == f) way[l][r] = 1;
      }
    }
  int res = 0;
  pair<int, int> mx;
  for (int i = 0; i < MAX; i++)
    for (int t = 0; t < MAX; t++) {
      res = max(res, dp[i][t]);
      if (res == dp[i][t]) mx = make_pair(i, t);
    }
  cout << res << "\n";
  print(mx.first, mx.second);
  cout << "\n";
}
