Let the length of sorted arrays of A1, A2, A3, A4, A5, and A6 be 41, 30, 15, 80, 25 and 50 respectively. To merge them into a single array A by merging two arrays at a time using optimal algorithm. In worst case, the maximum number of comparisons needed is _____.
Enter numerical value using the virtual keypad. Round off where necessary.