#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int> > a[101000];
vector<long long> v[101000];
map<int, int> mp;
int nc = 0;
long long m1[101000];
long long m2[101000];
int i1[101000];
int i2[101000];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    int s, c;
    scanf("%d %d", &c, &s);
    int p = mp[c];
    if (p == 0) {
      mp[c] = nc + 1;
      p = nc + 1;
      ++nc;
    }
    a[p - 1].push_back(pair<int, int>(s, i + 1));
  }
  for (int i = 0; i < nc; ++i) {
    sort(a[i].begin(), a[i].end());
    reverse(a[i].begin(), a[i].end());
  }
  memset(m1, -1, sizeof(m1));
  memset(m2, -1, sizeof(m1));
  memset(i1, -1, sizeof(i1));
  memset(i2, -1, sizeof(i2));
  for (int i = 0; i < nc; ++i) {
    v[i].resize(a[i].size());
    v[i][0] = a[i][0].first;
    if (m1[0] <= v[i][0]) {
      m1[0] = v[i][0];
      i1[0] = i;
    }
    for (int j = 1; j < a[i].size(); ++j) {
      v[i][j] = v[i][j - 1] + a[i][j].first;
      if (m1[j] <= v[i][j]) {
        m1[j] = v[i][j];
        i1[j] = i;
      }
    }
  }
  for (int i = 0; i < nc; ++i) {
    for (int j = 0; j < v[i].size(); ++j) {
      if (m2[j] < v[i][j] && i != i1[j]) {
        m2[j] = v[i][j];
        i2[j] = i;
      }
    }
  }
  long long res = m1[0] + m2[0];
  int c1 = i1[0], c2 = i2[0];
  for (int i = 1; i < 100000; ++i) {
    if (i1[i] == -1) break;
    long long x = m1[i];
    long long y = m2[i];
    int cc = i2[i];
    if (i1[i] != i1[i - 1]) {
      if (m1[i - 1] > y) {
        y = m1[i - 1];
        cc = i1[i - 1];
      }
    } else {
      if (m2[i - 1] > y) {
        y = m2[i - 1];
        cc = i2[i - 1];
      }
    }
    if (y >= 0 && res < x + y) {
      res = x + y;
      c1 = i1[i];
      c2 = cc;
    }
  }
  int x;
  if (v[c1].size() == v[c2].size())
    x = v[c1].size() + v[c2].size();
  else
    x = min(v[c1].size(), v[c2].size()) * 2 + 1;
  printf("%I64d\n", res);
  printf("%d\n", x);
  int p = 0, q = 0;
  if (v[c2].size() > v[c1].size()) {
    swap(c1, c2);
  }
  for (int i = 0; i < x; ++i) {
    printf("%d ", a[c1][p].second);
    ++p;
    swap(p, q);
    swap(c1, c2);
  }
  printf("\n");
  return 0;
}
