Little Janet likes playing with cubes. Actually, she likes to play with anything whatsoever, cubes or tesseracts, as long as they are multicolored. Each cube is described by two parameters — color ci and size si. A Zebra Tower is a tower that consists of cubes of exactly two colors. Besides, the colors of the cubes in the tower must alternate (colors of adjacent cubes must differ). The Zebra Tower should have at least two cubes. There are no other limitations. The figure below shows an example of a Zebra Tower.

<image>

A Zebra Tower's height is the sum of sizes of all cubes that form the tower. Help little Janet build the Zebra Tower of the maximum possible height, using the available cubes.

Input

The first line contains an integer n (2 ≤ n ≤ 105) — the number of cubes. Next n lines contain the descriptions of the cubes, one description per line. A cube description consists of two space-separated integers ci and si (1 ≤ ci, si ≤ 109) — the i-th cube's color and size, correspondingly. It is guaranteed that there are at least two cubes of different colors.

Output

Print the description of the Zebra Tower of the maximum height in the following form. In the first line print the tower's height, in the second line print the number of cubes that form the tower, and in the third line print the space-separated indices of cubes in the order in which they follow in the tower from the bottom to the top. Assume that the cubes are numbered from 1 to n in the order in which they were given in the input.

If there are several existing Zebra Towers with maximum heights, it is allowed to print any of them. 

Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.

Examples

Input

4
1 2
1 3
2 4
3 3


Output

9
3
2 3 1 


Input

2
1 1
2 1


Output

2
2
2 1 
#include <bits/stdc++.h>
using namespace std;
template <int M, template <typename> class F = greater>
struct TupleCompare {
  template <typename T>
  bool operator()(T const& t1, T const& t2) {
    return F<typename tuple_element<M, T>::type>()(std::get<M>(t1),
                                                   std::get<M>(t2));
  }
};
class dict {
  map<unsigned long long,
      vector<tuple<unsigned long long, unsigned long long> > >
      indexes;
  int index = 0;

 public:
  void add_box(unsigned long long, unsigned long long, unsigned long long);
  void solve();
  void print();

 private:
  void sort_map();
  void sum_up();
  void prune(int);
};
void dict::add_box(unsigned long long color, unsigned long long size,
                   unsigned long long ind) {
  indexes[color].push_back(
      tuple<unsigned long long, unsigned long long>(size, ind));
}
void dict::sort_map() {
  for (auto& box : indexes) {
    sort(begin(box.second), end(box.second), TupleCompare<0>());
  }
}
void dict::print() {
  for (auto& box : indexes) {
    for (int i = 0; i < box.second.size(); i++)
      cout << get<0>(box.second[i]) << " ";
    cout << endl;
  }
}
void dict::sum_up() {
  for (auto& box : indexes)
    for (int i = 1; i < box.second.size(); i++)
      get<0>(box.second[i]) += get<0>(box.second[i - 1]);
}
void dict::prune(int size) {
  std::map<unsigned long long,
           vector<tuple<unsigned long long, unsigned long long> > >::iterator
      gmax1 = indexes.end();
  std::map<unsigned long long,
           vector<tuple<unsigned long long, unsigned long long> > >::iterator
      gmax2 = indexes.end();
  for (std::map<unsigned long long,
                vector<tuple<unsigned long long, unsigned long long> > >::
           iterator i = indexes.begin();
       i != indexes.end();) {
    if (i->second.size() == size) {
      if (gmax1 == indexes.end())
        gmax1 = i;
      else if (gmax2 == indexes.end()) {
        if (get<0>(i->second[size - 1]) > get<0>(gmax1->second[size - 1])) {
          gmax2 = gmax1;
          gmax1 = i;
        } else {
          gmax2 = i;
        }
      } else {
        if (get<0>(i->second[size - 1]) > get<0>(gmax1->second[size - 1])) {
          indexes.erase(gmax2);
          gmax2 = gmax1;
          gmax1 = i;
        } else if (get<0>(i->second[size - 1]) >
                   get<0>(gmax2->second[size - 1])) {
          indexes.erase(gmax2);
          gmax2 = i;
        } else {
          indexes.erase(i++);
          continue;
        }
      }
    }
    i++;
  }
}
void dict::solve() {
  sort_map();
  sum_up();
  prune(1);
  prune(2);
  prune(3);
  prune(4);
  prune(5);
  prune(6);
  prune(7);
  prune(8);
  prune(9);
  prune(10);
  std::map<unsigned long long,
           vector<tuple<unsigned long long, unsigned long long> > >::iterator
      gmin,
      gmax;
  unsigned long long height = 0;
  int nblocks = 0;
  for (std::map<unsigned long long,
                vector<tuple<unsigned long long, unsigned long long> > >::
           iterator i = indexes.begin();
       i != prev(indexes.end()); i++) {
    for (std::map<unsigned long long,
                  vector<tuple<unsigned long long, unsigned long long> > >::
             iterator j = next(i);
         j != indexes.end(); j++) {
      std::map<unsigned long long,
               vector<tuple<unsigned long long, unsigned long long> > >::
          iterator cmin,
          cmax;
      if (i->second.size() < j->second.size()) {
        cmin = i;
        cmax = j;
      } else {
        cmin = j;
        cmax = i;
      }
      int min_ind = cmin->second.size() - 1;
      unsigned long long ph =
          get<0>(cmin->second[min_ind]) + get<0>(cmax->second[min_ind]);
      int cnblocks = cmin->second.size() * 2;
      if (cmax->second.size() > cmin->second.size()) {
        ph -= get<0>(cmax->second[min_ind]);
        ph += get<0>(cmax->second[min_ind + 1]);
        cnblocks += 1;
      }
      if (ph > height) {
        height = ph;
        gmin = cmin;
        gmax = cmax;
        nblocks = cnblocks;
      }
    }
  }
  cout << height << endl;
  cout << nblocks << endl;
  for (int i = 0; i < gmin->second.size(); i++) {
    if (i > 0) cout << ' ';
    cout << get<1>(gmax->second[i]) << ' ' << get<1>(gmin->second[i]);
  }
  if (gmin->second.size() < gmax->second.size())
    cout << ' ' << get<1>(gmax->second[gmin->second.size()]);
  cout << endl;
}
int main() {
  unsigned long long n, c, s;
  dict cubes;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> c >> s;
    cubes.add_box(c, s, i);
  }
  cubes.solve();
}
