Packets

A factory produces products that all have the same height $h$ and square bases of sizes $1\times1$, $2\times2$, $3\times3$, $4\times4$, $5\times5$, and $6\times6$. These products are always delivered to customers in square parcels that have the same height $h$ and a base of size $6\times6$. Because of shipping costs, both the factory and the customer want to minimize the number of parcels needed to deliver an order. Write a program that, for each order, finds the minimum number of parcels required.

The input consists of several lines, each describing one order. Each order is given as six integers separated by single spaces, listing the number of products of each size in order from the smallest ($1\times1$) to the largest ($6\times6$). The input ends with a line containing six zeros.

For each order line (except the final line of six zeros), print a single line containing the minimum number of parcels into which that order can be packed.