#include <bits/stdc++.h>
using namespace std;

int n, m;
int cnt[50];
int a[50];



int walk_time(int x, int y) {
    return abs(x-y)*20;
}

int ele_time(int x, int y) {
    return abs(x-y)*4;
}

bool check(int mx, vector<int> &vec)
{
    vec.clear();
    vector<pair<int, int>> q;
    int tmp;
    q.push_back({1, 0});
    for (int i=1; i<=m; i++) {
        auto [x, t] = q.back();
        tmp = walk_time(a[i], x);
        if (tmp <= mx) continue;
        q.push_back({a[i], t+(x==1 ? 0 : 10)+ele_time(x, a[i])});
        vec.push_back(a[i]);
    }
    return q.back().second <= mx;
}


bool solve()
{
    memset(cnt, 0, sizeof(cnt));
    scanf("%d", &n);
    if (n == 0) return false;
    m = 0;
    for (int i=1, v; i<=n; i++) scanf("%d", &v), cnt[v]++;
    for (int i=2; i<=31; i++) if (cnt[i]) a[++m] = i;;

    int ans = 1e9;
    vector<int> ansvec, tmpvec;
    int L, R, M;
    for (L=(a[m]-1)*4, R=500; L <= R; ) {
        M = (L+R)/2;
        if (check(M, tmpvec)) {
            ans = M;
            ansvec = tmpvec;
            R = M-1;
        }
        else {
            L = M+1;
        }
    }

    printf("%d\n%ld", ans, ansvec.size());
    for (int x: ansvec) printf(" %d", x);
    puts("");
    return true;
}


int main()
{
    while (solve())
        ;
}