I'm Growing

DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practical use of

DescriptionFarmer John is continuing to ponder the issue of cows crossing the road through his farm, introduced in the preceding two problems. He realizes now that the threshold for friendliness

Description有一个长度为n的字符串，每一位只会是p或j。你需要取出一个子串S（从左到右或从右到左一个一个取出），使得 不管是从左往右还是从右往左取，都保证每时每刻已取出的p的个数不小于j的个数。你需要最大化|S|。 Input第一行一个整数n，接下来一个长度为n的只含有p,j的字符串 N<=10^6 Output输出S的最大长度 Sample Input6jpjppj Samp