#include<bits/stdc++.h>

using namespace std;

const int M=2e5+;

struct node{

    int val,id;

}a[M];

int dp[M];

int ans[M],pre[M];

bool cmp(node p,node q){

    return p.val<q.val;

}

int main(){

    int n;

    scanf("%d",&n);

    for(int i=;i<=n;i++)

        scanf("%d",&a[i].val),a[i].id=i;

    sort(a+,a++n,cmp);

    memset(dp,0x3f,sizeof(dp));

    dp[]=;

    pre[]=-;

    for(int i=;i<=n;i++){

        for(int j=;j<=;j++){

            if(i-j>=&&dp[i-j]+a[i].val-a[i-j+].val<dp[i]){

                pre[i]=i-j;

                dp[i]=dp[i-j]+a[i].val-a[i-j+].val;

            }

        }

    }

    int tot=;

    for(int i=n;i>=;i=pre[i]){

        tot++;

        for(int j=i;j>pre[i];j--)

            ans[a[j].id]=tot;

    }

    printf("%d %d\n",dp[n],tot);

    for(int i=;i<=n;i++)

        printf("%d ",ans[i]);

    return ;

}