Problem: Sig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the `0` key, the `1` key and the backspace key.

To begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:

* The `0` key: a letter `0` will be inserted to the right of the string.
* The `1` key: a letter `1` will be inserted to the right of the string.
* The backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.



Sig has launched the editor, and pressed these keys N times in total. As a result, the editor displays a string s. Find the number of such ways to press the keys, modulo 10^9 + 7.

Constraints

* 1 ≦ N ≦ 5000
* 1 ≦ |s| ≦ N
* s consists of the letters `0` and `1`.

Input

The input is given from Standard Input in the following format:


N
s


Output

Print the number of the ways to press the keys N times in total such that the editor displays the string s in the end, modulo 10^9+7.

Examples

Input

3
0


Output

5


Input

300
1100100


Output

519054663


Input

5000
01000001011101000100001101101111011001000110010101110010000


Output

500886057

Solution (in JAVA):

Solution:
import java.util.*;

public class Main {
	final static long MOD = 1000000007;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.next().length();

		long[][] dp = new long[2][N+1];
		dp[0][0] = 1;
		long[] zero = new long[N+1];
		zero[0] = 1;
		for(int i=0; i<N; i++) {
			Arrays.fill(dp[(i+1)%2], 0);
			for(int j=0; j<=i; j++) {
				dp[(i+1)%2][j+1] = (dp[(i+1)%2][j+1] + dp[i%2][j]*2)%MOD;
				dp[(i+1)%2][Math.max(0, j-1)] = (dp[(i+1)%2][Math.max(0, j-1)] + dp[i%2][j])%MOD;
			}
			zero[i+1] = dp[(i+1)%2][0];
		}
		for(int i=0; i<=N; i++)
			for(int j=0; j<(N-i-M)/2; j++)
				zero[i] = (zero[i]*2)%MOD;
		
		for(int i=0; i<N; i++) {
			Arrays.fill(dp[(i+1)%2], 0);
			dp[i%2][0] = zero[i];
			for(int j=0; j<=i; j++) {
				dp[(i+1)%2][j+1] = (dp[(i+1)%2][j+1] + dp[i%2][j])%MOD;
				if(j-1>0)
					dp[(i+1)%2][j-1] = (dp[(i+1)%2][j-1] + dp[i%2][j])%MOD;
			}
		}
		
		System.out.println(dp[N%2][M]);
		
		sc.close();
	}
	
}