#include <bits/stdc++.h>
using namespace std;
int cnt[200007];
int main() {
  int i, j, k, l, m, n;
  string s, t;
  cin >> s >> t;
  n = s.size();
  m = t.size();
  for (i = 0; i < n; i++) {
    if (s[i] == '1') cnt[n - 1 - i]++;
  }
  for (i = 0; i < m; i++) {
    if (t[i] == '1') cnt[m - 1 - i]--;
  }
  for (i = max(n, m) - 1; i >= 2; i--) {
    if (cnt[i] >= 2)
      return cout << ">" << endl, 0;
    else if (cnt[i] <= -2)
      return cout << "<" << endl, 0;
    if (cnt[i] > 0) {
      cnt[i - 1]++;
      cnt[i - 2]++;
      cnt[i]--;
    }
    if (cnt[i] < 0) {
      cnt[i - 1]--;
      cnt[i - 2]--;
      cnt[i]++;
    }
  }
  if (cnt[1] > 0 || (cnt[1] == 0) && (cnt[0] > 0)) {
    cout << ">" << endl;
  } else if (cnt[1] < 0 || (cnt[1] == 0) && (cnt[0] < 0))
    cout << "<" << endl;
  else
    cout << "=" << endl;
}
