Pieces

Time Limit: 3000ms
Memory Limit: 131072KB
This problem will be judged on HDU. Original ID: 4628
64-bit integer IO format: %I64d      Java class name: Main

Description

You heart broke into pieces.My string broke into pieces.But you will recover one day,and my string will never go back.
Given a string s.We can erase a subsequence of it if this subsequence is palindrome in one step. We should take as few steps as possible to erase the whole sequence.How many steps do we need?
For example, we can erase abcba from axbyczbea and get xyze in one step.

Input

The first line contains integer T,denote the number of the test cases. Then T lines follows,each line contains the string s (1<= length of s <= 16).
T<=10.

Output

For each test cases,print the answer in a line.

Sample Input

2
aa
abb

Sample Output

1
2

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .