Bear and Segment 01

Bear Limak has a string S. Each character of S is a digit '0' or '1'. Help Limak and check if all the '1' digits form a single non-empty segment (consecutive subsequence) in the string. For each test case, print "YES" or "NO" accordingly. Input The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The only line of eac