B'Sereja painted n points on the plane, point number i (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) has coordinates (i, xe2 x80 x890). Then Sereja marked each point with a small or large English letter. Sereja don 't like letter "x", so he didn 't use it to mark points. Sereja thinks that the points are marked beautifully if the following conditions holds: Little Petya erased some small and all large letters marking the points. Now Sereja wonders how many ways are there to return the removed letters so that the points were marked beautifully. The first line contains integer n the number of points (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). The second line contains a sequence consisting of n small English letters and question marks -- the sequence of letters, that mark points, in order of increasing x-coordinate of points. Question marks denote the points without letters (Petya erased them). It is guaranteed that the input string doesn 't contain letter "x". In a single line print the answer to the problem modulo 4294967296. If there is no way to return the removed letters, print number 0. Please, do not write the %lld specifier to read or write 64-bit integers in xd0 xa1++. It is preferred to use the cin, cout streams or the %I64d specifier.'...