#include <bits/stdc++.h>
using namespace std;
char s[120000];
int a[120000], b[120000], c[120000], n, m;
int solve() {
  if (m > n) n = m;
  memset(c, 0, sizeof(c));
  for (int i = 0; i < n; ++i) c[i] = a[i] - b[i];
  if (n == 1) return c[0];
  for (int i = n - 1; i > 1; --i) {
    if (abs(c[i]) >= 2) return c[i];
    c[i - 1] += c[i];
    c[i - 2] += c[i];
  }
  return c[1] * 4 + c[0];
}
int main() {
  while (scanf("%s", s) != EOF) {
    memset(a, 0, sizeof(a)), memset(b, 0, sizeof(b));
    n = strlen(s);
    int l = 0;
    while (l < n - 1 && s[l] == '0') ++l;
    for (int i = l; i < n; ++i) a[n - i - 1] = s[i] - '0';
    n -= l;
    scanf("%s", s);
    m = strlen(s);
    l = 0;
    while (l < m - 1 && s[l] == '0') ++l;
    for (int i = 0; i < m; ++i) b[m - i - 1] = s[i] - '0';
    m -= l;
    int ans = solve();
    ans == 0 ? puts("=") : (ans < 0) ? puts("<") : puts(">");
  }
  return 0;
}
