Problem: Dreamoon is standing at the position 0 on a number line. Drazil is sending a list of commands through Wi-Fi to Dreamoon's smartphone and Dreamoon follows them.

Each command is one of the following two types: 

  1. Go 1 unit towards the positive direction, denoted as '+'
  2. Go 1 unit towards the negative direction, denoted as '-'



But the Wi-Fi condition is so poor that Dreamoon's smartphone reports some of the commands can't be recognized and Dreamoon knows that some of them might even be wrong though successfully recognized. Dreamoon decides to follow every recognized command and toss a fair coin to decide those unrecognized ones (that means, he moves to the 1 unit to the negative or positive direction with the same probability 0.5). 

You are given an original list of commands sent by Drazil and list received by Dreamoon. What is the probability that Dreamoon ends in the position originally supposed to be final by Drazil's commands?

Input

The first line contains a string s1 — the commands Drazil sends to Dreamoon, this string consists of only the characters in the set {'+', '-'}. 

The second line contains a string s2 — the commands Dreamoon's smartphone recognizes, this string consists of only the characters in the set {'+', '-', '?'}. '?' denotes an unrecognized command.

Lengths of two strings are equal and do not exceed 10.

Output

Output a single real number corresponding to the probability. The answer will be considered correct if its relative or absolute error doesn't exceed 10 - 9.

Examples

Input

++-+-
+-+-+


Output

1.000000000000


Input

+-+-
+-??


Output

0.500000000000


Input

+++
??-


Output

0.000000000000

Note

For the first sample, both s1 and s2 will lead Dreamoon to finish at the same position  + 1. 

For the second sample, s1 will lead Dreamoon to finish at position 0, while there are four possibilites for s2: {"+-++", "+-+-", "+--+", "+---"} with ending position {+2, 0, 0, -2} respectively. So there are 2 correct cases out of 4, so the probability of finishing at the correct position is 0.5. 

For the third sample, s2 could only lead us to finish at positions {+1, -1, -3}, so the probability to finish at the correct position  + 3 is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
template <class T>
using min_q = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using namespace std;
const int MOD = 1000000000;
bool isletter(char f) { return f >= 'a' && f <= 'z'; }
int const nmax = 1000;
int v[5 + nmax];
int isfib[5 + nmax];
void fib(int n) {
  v[0] = 1;
  v[1] = 1;
  isfib[1] = 1;
  for (int i = 2; i <= n; i++) {
    v[i] = v[i - 1] + v[i - 2];
    if (v[i] <= n)
      isfib[v[i]] = 1;
    else
      break;
  }
}
template <typename T>
void primefactors(T n) {
  while (n % 2 == 0) {
    cout << 2 << " ";
    n /= 2;
  }
  for (T i = 3; i * i <= n; i++) {
    while (n % i == 0) {
      cout << i << " ";
      n /= i;
    }
  }
  if (n > 2) cout << n << "\n";
}
void SieveOfEratosthenes(long long n) {
  vector<bool> prime(n + 1);
  fill(((prime).begin()), ((prime).end()), 1);
  for (long long p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long i = p * 2; i <= n; i += p) prime[i] = false;
    }
  }
}
template <typename T>
T power(int p, T b) {
  if (p == 0) return 1;
  return b * power(p - 1, b);
}
char grid[501][501];
bool vis[501][501] = {0};
int cnt = 0;
void find_max(int r, int c, int n, int k) {
  if (vis[r][c] || r >= n || c >= k || r < 0 || c < 0 || grid[r][c] == 'S')
    return;
  vis[r][c] = 1;
  cnt++;
}
void matching(string x, string y) {
  int n = x.size();
  int m = y.size();
  for (int i = 0; i <= n - m; i++) {
    int j;
    for (j = 0; j < m; j++) {
      if (x[i + j] != y[j]) {
        break;
      }
    }
    if (m == j) {
      cout << "Found at: " << i << "\n";
    }
  }
}
string s, t;
int last, start, ans, x;
void calc(int pos, int u) {
  if (u == x) {
    if (pos == last) ans++;
    return;
  }
  calc(pos + 1, u + 1);
  calc(pos - 1, u + 1);
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> s >> t;
  start = last = ans = x = 0;
  for (int i = 0; i < (int)((int)(s.size())); i++) {
    s[i] == '+' ? start++ : start--;
  }
  for (int i = 0; i < (int)((int)(t.size())); i++) {
    if (t[i] == '+')
      last++;
    else if (t[i] == '-')
      last--;
    else
      x++;
  }
  calc(start, 0);
  printf("%.9lf\n", (double)ans / power(x, 2));
  return 0;
}