#include <bits/stdc++.h>
using namespace std;
long long pow2(long long k, long long h) {
  if (h == 0)
    return 1;
  else if (h == 1)
    return k;
  else {
    long long p = pow2(k, h / 2);
    p *= p;
    if (h % 2 == 1) p *= k;
    return p;
  }
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long bin(long long a, vector<long long>& s) {
  long long l = 0, r = s.size() - 1, j = 0, j2 = 0;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (s[mid] < a) {
      j = mid;
      l = mid + 1;
    } else if (s[mid] > a) {
      r = mid - 1;
    } else {
      return 0;
    }
  }
  return min(abs(a - s[j]), abs(a - s[j + 1]));
}
bool cmp(string a, string b) {
  if (a.size() < b.size())
    return 1;
  else
    return 0;
}
bool sumnumber(long long g) {
  long long sum = 0;
  while (g > 0) {
    sum += g % 10;
    g /= 10;
  }
  if (sum == 10)
    return true;
  else
    return false;
}
long long a[1000009], x[1000009], b[1000009];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, sum = 0, j = 1, maxx = 0, m = 0;
  cin >> n;
  vector<pair<int, int>> v;
  vector<int> ans;
  for (int i = 1; i <= n; ++i) {
    cin >> m;
    v.push_back({m, i});
  }
  sort(v.begin(), v.end(), greater<pair<int, int>>());
  for (int i = 0; i < n; ++i) {
    sum += (v[i].first * (i) + 1);
    ans.push_back(v[i].second);
  }
  cout << sum << endl;
  for (int i = 0; i < ans.size(); ++i) cout << ans[i] << " ";
  return 0;
}
