http://codeforces.com/contest/1256/problem/E
#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>
#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int mod=1e9+7;
const int N=5e5+9;
pair<int,int>p[N];
int pre[N];
ll dp[N];
int num=0;
bool vis[N];
int ans[N];
void dfs(int u)
{
if(u==0) return ;
num++;
vis[u]=1;
dfs(pre[u]);
}
int main()
{
FAST_IO;
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>p[i].first,p[i].second=i;
sort(p+1,p+1+n);
mem(dp,-1);
dp[0]=0;
dp[3]=p[3].first-p[1].first;
for(int i=4;i<=n;i++)
{
for(int j=3;j<=6;j++)
{
if(dp[i-j]!=-1)
{
if(dp[i]==-1)
{
dp[i]=dp[i-j]+p[i].first-p[i-j+1].first;
pre[i]=i-j;
}
else if(dp[i]>dp[i-j]+p[i].first-p[i-j+1].first)
{
dp[i]=dp[i-j]+p[i].first-p[i-j+1].first;
pre[i]=i-j;
}
}
}
}
dfs(n);
cout<<dp[n]<<' '<<num<<endl;
int cnt=1;
for(int i=1;i<=n;i++)
{
ans[p[i].second]=cnt;
if(vis[i])
{
cnt++;
}
}
for(int i=1;i<=n;i++) cout<<ans[i]<<" ";
cout<<endl;
return 0;
}