MINOS 5.5: optimal solution found.
174 iterations, objective 0
Nonlin evals: constrs = 554, Jac = 553.
Objective = find a feasible point.
x [*] :=
 1 1.043         7 0.143434     13 0.0506097    19 0.0274381    25 0.0100371
 2 0.56492       8 0.136635     14 0.0478538    20 0.0188746    26 0.00994081
 3 0.347378      9 0.133237     15 0.0469163    21 0.0144929    27 0.00972187
 4 0.238609     10 0.0892316    16 0.0459536    22 0.0121498    28 0.00946998
 5 0.184224     11 0.0670817    17 0.045485     23 0.0110034    29 0.00971783
 6 0.157031     12 0.0560718    18 0.0410401    24 0.0106512    30 0.00997515
;