For given string ‘str’ of digits, find length of the **longest** substring of ‘str’, such that the length of the substring is 2k digits and sum of left k digits is equal to the sum of right k digits.

**Input:**

The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows.

Each test case contains a string string of length N.

**Output:**

Print length of the longest substring of length 2k such that sum of left k elements is equal to right k elements and if there is no such substring print 0.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 100

**Example:**

Input:

2

000000

1234123

Output:

6

4

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Sulagna | 117 |

RUTVIKHARIPARA | 116 |

janvidavda105190 | 93 |

harshsiddhapura105461 | 93 |

devsinghindra | 80 |

PiyushPandey4 | 614 |

ASWATHAMA | 561 |

akhyasharma01 | 547 |

john_wick | 521 |

jagrit_07 | 443 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4598 |

Login to report an issue on this page.