Pakkaus

import re
mx = int(input())

s = input().split(" ")

arr = []
editArr = []
counter = 0

for obj in s:
    arr.append(int(obj))


def findMax(a, ign):
    rtn = 0
    for obj in a:
        if obj < ign or ign == -1:
            rtn = max(rtn, obj)
    return rtn

def canFit(a, ARR, n):
    for _numb in a:
        if abs(ARR.index(_numb) - ARR.index(n)) == 1:
            return False
    return True

def mihinmenee(a, b, c, n, ign):
    l1 = [n-a, n-b, n-c]
    l1.sort()

    if l1[0] == n-a and ign != 1:
        return 1
    if l1[0] == n - b and ign != 2:
        return 2
    if l1[0] == n - c and ign != 3:
        return 3
    if l1[1] == n - a and ign != 1:
        return 1
    if l1[1] == n - b and ign != 2:
        return 2
    if l1[1] == n - c and ign != 3:
        return 3

def mitaHaluat(a,b):
    bbb = [1, 2, 3]
    bbb.remove(a)
    bbb.remove(b)
    return bbb[0]


max1 = findMax(arr, -1)
max1Index = arr.index(max1)
max2Index = 0
max2 = 0

if arr.__len__() != 1:
    tempa = arr[:]
    tempa[max1Index] = 1
    max2 = findMax(tempa, -1)
    max2Index = tempa.index(max2)

i = 0
sumstr = ""
arr31 = []
arr32 = []
arr33 = []

if arr.__len__() == 1:
    print(str(max1) + " 1")
    print("1")


else:
    maxx1 = 0
    maxx2 = 0
    maxx3 = 0
    summa = []
    sss = ""
    q = 0

    while i < arr.__len__():
        if i % 2 == 0:
            max1 = max(max1, arr[i])
            sss += str(1) + " "
        else:
            max2 = max(max2, arr[i])
            sss += str(2) + " "
        i += 1

    kkk = max1 + max2
    i = 0
    bol = []


    while i < arr.__len__():

        e1 = arr31.__len__()-1
        e2 = arr32.__len__() - 1
        e3 = arr33.__len__() - 1
        s = arr[min(i+1, arr.__len__()-1)]
        if bol.__len__() > 1:
            ff = mihinmenee(maxx1, maxx2, maxx3, arr[i], bol[bol.__len__() - 1])
            ss = mihinmenee(maxx1, maxx2, maxx3, s, bol[bol.__len__() - 1])
        if i == 0:
            arr31.append(arr[i])
            maxx1 = max(maxx1, arr[i])
            sumstr += "1 "
            bol.append(1)
        elif i == 1:
            arr32.append(arr[i])
            maxx2 = max(maxx2, arr[i])
            sumstr += "2 "
            bol.append(2)

        elif ff == ss and s > arr[i]:
            if arr.__len__() -1 - i > 1:
                if arr[i + 2] > arr[i + 1]:
                    if bol[bol.__len__()-2] == 1:
                        arr31.append(arr[i])
                        maxx1 = max(maxx1, arr[i])
                        sumstr += "1 "
                        bol.append(1)
                    elif bol[bol.__len__() -2] == 2:
                        arr32.append(arr[i])
                        maxx2 = max(maxx2, arr[i])
                        sumstr += "2 "
                        bol.append(2)
                    elif bol[bol.__len__() - 2] == 3:
                        arr33.append(arr[i])
                        maxx3 = max(maxx3, arr[i])
                        sumstr += "3 "
                        bol.append(3)
                else:
                    mh = mitaHaluat(bol[bol.__len__()-1], ss)
                    if mh == 1:
                        arr31.append(arr[i])
                        maxx1 = max(maxx1, arr[i])
                        sumstr += "1 "
                        bol.append(1)
                    if mh == 2:
                        arr32.append(arr[i])
                        maxx2 = max(maxx2, arr[i])
                        sumstr += "2 "
                        bol.append(2)
                    if mh == 3:
                        arr33.append(arr[i])
                        maxx3 = max(maxx3, arr[i])
                        sumstr += "3 "
                        bol.append(3)
            else:
                if bol[bol.__len__()-1] != 3:
                    arr33.append(arr[i])
                    maxx3 = max(maxx3, arr[i])
                    sumstr += "3 "
                    bol.append(3)
                else:
                    mh = mitaHaluat(bol[bol.__len__() - 1], ss)
                    if mh == 1:
                        arr31.append(arr[i])
                        maxx1 = max(maxx1, arr[i])
                        sumstr += "1 "
                        bol.append(1)
                    if mh == 2:
                        arr32.append(arr[i])
                        maxx2 = max(maxx2, arr[i])
                        sumstr += "2 "
                        bol.append(2)
                    if mh == 3:
                        arr33.append(arr[i])
                        maxx3 = max(maxx3, arr[i])
                        sumstr += "3 "
                        bol.append(3)


        else:
            if ff == 1:
                arr31.append(arr[i])
                maxx1 = max(maxx1, arr[i])
                sumstr += "1 "
                bol.append(1)
            elif ff == 2:
                arr32.append(arr[i])
                maxx2 = max(maxx2, arr[i])
                sumstr += "2 "
                bol.append(2)

            elif ff == 3:
                arr33.append(arr[i])
                maxx3 = max(maxx3, arr[i])
                sumstr += "3 "
                bol.append(3)

        i += 1
    ddd = findMax(arr31, -1) + findMax(arr32, -1) + findMax(arr33, -1)

    if ddd < kkk:

        if bol.__contains__(3):
            print(str(ddd) + " 3")
        else:
            print(str(ddd) + " 2")
        print(sumstr)
    else:
        print(str(kkk) + " 2")
        print(sss)

Test 1

Group: 1

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 2

Group: 1

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 3

Group: 1

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 4

Group: 1

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 5

Group: 1

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 6

Group: 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 7

Group: 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 8

Group: 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 9

Group: 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 10

Group: 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 11

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 12

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 13

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 14

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...

Test 15

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 2, in <module>
    mx = in...