#描述#
Jesus, what a great movie! Thousands of people are rushing to the cinema.<br> However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.<br>
A good approach, reducing the total time of tickets selling, is let adjacent people buy tickets together. As the restriction of the Ticket Seller Machine, Joe can sell a single ticket or two adjacent tickets at a time.<br>
Since you are the great JESUS, you know exactly how much time needed for every person to buy a single ticket or two tickets for him/her and the person next to him/her. Could you so kind to tell poor Joe at what time could he go back home as early as possible? If so, I guess Joe would full of appreciation for your help.

#格式#
##输入格式##
There are N (1≤N≤10) different scenarios, each scenario consists of 3 lines:
1) An integer K (0≤K≤2000) representing the total number of people;2) K integer numbers (0s≤Si≤25s) representing the time consumed to buy a ticket for each person;3) (K-1) integer numbers (0s≤Di≤50s) representing the time needed for two adjacent people to buy two tickets together.

##输出格式##
For every scenario, please tell Joe at what time could he go back home as early as possible. Every day Joe started his work at 08:00:00 am. The format of time is HH:MM:SS am|pm.

#样例1#
##样例输入1##

2
2
20 25
40
1
8

##样例输出1##

08:00:40 am
08:00:08 am

#限制#
1000ms
32768KB

#提示#

#来源#
Jin Shunjing