#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int N = 2e5 + 9;
char tmp[N];
int a[N], b[N];
int main() {
  scanf("%s", tmp);
  int n1 = strlen(tmp);
  for (int i = n1 - 1; i >= 0; i--) {
    a[i] = tmp[n1 - 1 - i] - '0';
  }
  scanf("%s", tmp);
  int n2 = strlen(tmp);
  for (int i = n2 - 1; i >= 0; i--) {
    b[i] = tmp[n2 - 1 - i] - '0';
  }
  for (int i = n1 - 1; i >= 1; i--) {
    if (a[i] && a[i - 1]) {
      for (int j = i; j < n1; j += 2) {
        if (a[j] && a[j - 1]) {
          a[j]--;
          a[j - 1]--;
          a[j + 1]++;
          n1 = max(n1, j + 2);
        } else
          break;
      }
    }
  }
  for (int i = n2 - 1; i >= 1; i--) {
    if (b[i] && b[i - 1]) {
      for (int j = i; j < n2; j += 2) {
        if (b[j] && b[j - 1]) {
          b[j]--;
          b[j - 1]--;
          b[j + 1]++;
          n2 = max(n2, j + 2);
        } else
          break;
      }
    }
  }
  int flag = 0;
  for (int i = max(n1, n2); i >= 0; i--) {
    if (a[i] > b[i]) {
      flag = 1;
      break;
    } else if (a[i] < b[i]) {
      flag = -1;
      break;
    }
  }
  if (flag == 1)
    puts(">");
  else if (flag == -1)
    puts("<");
  else
    puts("=");
}
