Longest streak with stock on the shelf

A pharmacy chain in Nairobi records the closing stock of a vital medicine every day. A day with stock 0 is a stockout. The regional manager wants the longest run of consecutive days in which the medicine was never out of stock, as a proof of good supply planning.

Task: the first line holds n (1 to 300). The second line holds n non-negative integers, the closing stock of each day. Print two integers separated by a space: the length of the longest run of days with stock greater than 0, and the 1-based day on which that run starts (choose the earliest run if there is a tie). If every day is a stockout, print 0 0.