Problem: Recently Vasya decided to improve his pistol shooting skills. Today his coach offered him the following exercise. He placed n cans in a row on a table. Cans are numbered from left to right from 1 to n. Vasya has to knock down each can exactly once to finish the exercise. He is allowed to choose the order in which he will knock the cans down.

Vasya knows that the durability of the i-th can is a_i. It means that if Vasya has already knocked x cans down and is now about to start shooting the i-th one, he will need (a_i ⋅ x + 1) shots to knock it down. You can assume that if Vasya starts shooting the i-th can, he will be shooting it until he knocks it down.

Your task is to choose such an order of shooting so that the number of shots required to knock each of the n given cans down exactly once is minimum possible.

Input

The first line of the input contains one integer n (2 ≤ n ≤ 1 000) — the number of cans.

The second line of the input contains the sequence a_1, a_2, ..., a_n (1 ≤ a_i ≤ 1 000), where a_i is the durability of the i-th can.

Output

In the first line print the minimum number of shots required to knock each of the n given cans down exactly once.

In the second line print the sequence consisting of n distinct integers from 1 to n — the order of indices of cans that minimizes the number of shots required. If there are several answers, you can print any of them.

Examples

Input


3
20 10 20


Output


43
1 3 2 


Input


4
10 10 10 10


Output


64
2 1 4 3 


Input


6
5 4 5 4 4 5


Output


69
6 1 3 5 2 4 


Input


2
1 4


Output


3
2 1 

Note

In the first example Vasya can start shooting from the first can. He knocks it down with the first shot because he haven't knocked any other cans down before. After that he has to shoot the third can. To knock it down he shoots 20 ⋅ 1 + 1 = 21 times. After that only second can remains. To knock it down Vasya shoots 10 ⋅ 2 + 1 = 21 times. So the total number of shots is 1 + 21 + 21 = 43.

In the second example the order of shooting does not matter because all cans have the same durability.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long double PI = (long double)(3.1415926535897932384626433832795);
int parity_check(int n) {
  int par = n;
  par = par ^ (par >> 1);
  par = par ^ (par >> 2);
  par = par ^ (par >> 4);
  par = par ^ (par >> 8);
  par = par ^ (par >> 16);
  if (par % 2 == 1) {
    return 1;
  } else {
    return 0;
  }
}
int lcs(string X, string Y, int m, int n) {
  int L[m + 1][n + 1];
  int i, j;
  for (i = 0; i <= m; i++) {
    for (j = 0; j <= n; j++) {
      if (i == 0 || j == 0)
        L[i][j] = 0;
      else if (X[i - 1] == Y[j - 1] && i != j)
        L[i][j] = L[i - 1][j - 1] + 1;
      else
        L[i][j] = max(L[i - 1][j], L[i][j - 1]);
    }
  }
  return L[m][n];
}
int long long gcd(int long long a, int long long b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
int long long lcm(int long long a, int long long b) {
  int long long pro = a * b;
  int long long ans = gcd(a, b);
  pro = pro / ans;
  return pro;
}
int long long fast_power(int long long a, int long long b, int long long p) {
  if (b == 0) {
    return (1 % p);
  }
  int long long t = fast_power(a, b / 2, p);
  int long long ans = (t * t) % p;
  if (b % 2) {
    ans = (ans * (a % p)) % p;
  }
  return ans;
}
bool prime_check(int long long n) {
  int long long i, j;
  if (n == 1) {
    return false;
  }
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
int long long fact(int long long n, int long long mod) {
  int long long prod = 1;
  for (int long long i = 1; i <= n; i++) {
    prod = (prod * i) % mod;
  }
  return prod;
}
void mera_sieve() {
  bool prime[6000013];
  memset(prime, true, sizeof(prime));
  for (int long long p = 2; p * p <= 6000012; p++) {
    if (prime[p] == true) {
      for (int long long i = p * p; i <= 6000012; i += p) prime[i] = false;
    }
  }
  for (int long long i = 2; i <= 6000012; i++) {
    if (prime[i]) {
    }
  }
}
void solve() {
  int n;
  cin >> n;
  vector<pair<int, int>> v;
  int long long ans = 0;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    v.push_back(make_pair(t, i + 1));
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    ans += (v[n - i - 1].first * i + 1);
  }
  cout << ans << "\n";
  for (int i = n - 1; i >= 0; i--) cout << v[i].second << " ";
}
int main() {
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}