**Compilation/Execution Result:**

Given a string str, your task is to complete the function **countPs** which takes a string str as its only argument and returns an integer denoting the no of palindromic subsequence (need not necessarily be distinct) which could be formed from the string str.

**Input:**

The first line of input contains an integer T, denoting the no of test cases then T test cases follow. Each test case contains a string str.

**Output:**

For each test case output will be an integer denoting the no of palindromic subsequence which could be formed from the string str.

**Constraints:**

1<=T<=100

1<=length of string str <=30

**Example(To be used only for expected output):
Input:**

2

abcd

aab

4

4

palindromic subsequence are : "a" ,"b", "c" ,"d"

palindromic subsequence are :"a", "a", "b", "aa"

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Author: Shubham Joshi 1

Rajat Thakur 2 | 251 |

surbhi_7 | 231 |

Anupam Prakash 1 | 215 |

Ibrahim Nash | 205 |

Vikram Sreenivasa | 175 |

Ibrahim Nash | 719 |

ashrepos | 578 |

shi143din | 438 |

RealHorror | 435 |

HABIB_SHEIKH | 369 |

akhayrutdinov | 4059 |

sanjay05 | 3451 |

Quandray | 2475 |

Michael Riegger | 2234 |

Jasleen Kaur 2 | 2012 |