description: After getting bored by playing with crayons, you decided to switch to Legos! Today, you're working with a long strip, with height 1 and length n, some positions of which are occupied by 1 by 1 Lego pieces.
  
  In one second, you can either remove two adjacent Lego pieces from the strip (if both are present), or add two Lego pieces to adjacent positions (if both are absent). You can only add or remove Lego's at two adjacent positions at the same time, as otherwise your chubby fingers run into precision issues.
  
  You want to know exactly how much time you'll spend playing with Legos. You value efficiency, so given some starting state and some ending state, you'll always spend the least number of seconds to transform the starting state into the ending state. If it's impossible to transform the starting state into the ending state, you just skip it (so you spend 0 seconds).
  
  The issue is that, for some positions, you don't remember whether there were Legos there or not (in either the starting state, the ending state, or both). Over all pairs of (starting state, ending state) that are consistent with your memory, find the total amount of time it will take to transform the starting state to the ending state. Print this value modulo 1 000 000 007 (10^9 + 7). 
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 1000) — the number of test cases. Then t cases follow.
  
  The first line of each test case contains one integer n (2 ≤ n ≤ 2000) — the size of the Lego strip.
  
  The second line of each test case contains a string s of length n, consisting of the characters 0, 1, and ? — your memory of the starting state: 
  
    * 1 represents a position that definitely has a Lego piece, 
    * 0 represents a position that definitely does not have a Lego piece, 
    * and ? represents a position that you don't remember. 
  
  
  
  The third line of each test case contains a string t of length n, consisting of the characters 0, 1, and ? — your memory of the ending state. It follows a similar format to the starting state.
  
  It's guaranteed that the sum of n over all test cases doesn't exceed 2000.
  
  Output
  
  For each test case, output a single integer — the answer to the problem modulo 1 000 000 007 (10^9 + 7). 
  
  Example
  
  Input
  
  
  6
  2
  00
  11
  3
  ???
  ???
  3
  ??1
  0?0
  4
  ??0?
  ??11
  5
  ?????
  0??1?
  10
  ?01??01?1?
  ??100?1???
  
  
  Output
  
  
  1
  16
  1
  14
  101
  1674
  
  Note
  
  For the first test case, 00 is the only possible starting state, and 11 is the only possible ending state. It takes exactly one operation to change 00 to 11.
  
  For the second test case, some of the possible starting and ending state pairs are: 
  
    * (000, 011) — takes 1 operation. 
    * (001, 100) — takes 2 operations. 
    * (010, 000) — takes 0 operations, as it's impossible to achieve the ending state. 
solution: #include <bits/stdc++.h>
  using namespace std;
  const int maxn = 2003;
  char s[maxn], t[maxn];
  const int M = 1000000007;
  int B = 2000;
  int _, n, f[maxn][maxn * 2], g[maxn][maxn * 2], ls[maxn], rs[maxn], lt[maxn],
      rt[maxn];
  void add(int &x, int y) {
    x += y;
    if (x >= M) x -= M;
  }
  int main() {
    scanf("%d", &_);
    while (_--) {
      scanf("%d", &n);
      scanf("%s%s", s, t);
      for (int i = 1; i < n; i += 2) {
        if (s[i] != '?') s[i] = '0' + '1' - s[i];
        if (t[i] != '?') t[i] = '0' + '1' - t[i];
      }
      for (int i = 0; i < n; i++) {
        if (s[i] == '?')
          ls[i] = 0, rs[i] = 1;
        else
          ls[i] = rs[i] = s[i] - '0';
        if (t[i] == '?')
          lt[i] = 0, rt[i] = 1;
        else
          lt[i] = rt[i] = t[i] - '0';
      }
      for (int i = 0; i <= n; i++)
        for (int j = -i; j <= i; j++) f[i][j + B] = g[i][j + B] = 0;
      f[0][B] = 1;
      for (int i = 0; i < n; i++)
        for (int j = -i; j <= i; j++)
          if (f[i][j + B])
            for (int x = ls[i]; x <= rs[i]; x++)
              for (int y = lt[i]; y <= rt[i]; y++) {
                int k = j + x - y;
                add(f[i + 1][k + B], f[i][j + B]);
                add(g[i + 1][k + B], g[i][j + B]);
                add(g[i + 1][k + B], 1ll * abs(k) * f[i][j + B] % M);
              }
      printf("%d\n", g[n][B]);
    }
    return 0;
  }
  