Find the maximal possible value of the real number T such that any collection of real numbers 0 ≤ xi ≤ 1, i = 1, 2, . . . , 2026 satisfying
x1 + x2 + · · · + x2026 = T
can be partitioned into to parts such that the sum of all numbers in the first part is at most 6 and the sum of all numbers in the second part is at most 12.