Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.