#include <bits/stdc++.h>
using namespace std;
const int MAXN = 111111;
const int MOD = 1e9;
const double eps = 1e-6;
const long long MAXL = (long long)(0x7fffffffffffffff);
const int MAXI = 0x7fffffff;
void removeZeros(string &s) {
  int id = -1;
  for (int i = 0; i < s.length(); i++) {
    if (s[i] != '0') {
      id = i;
      break;
    }
  }
  if (id == -1)
    s = "";
  else
    s = s.substr(id, s.length() - id);
}
struct cmp {
  bool operator()(int a, int b) { return a > b; }
};
int main() {
  string s, t;
  while (cin >> s >> t) {
    removeZeros(s);
    removeZeros(t);
    string s1 = "";
    for (int i = 0; i < (int)t.length() - (int)s.length(); i++) {
      s1 += "0";
    }
    s = s1 + s;
    string t1 = "";
    for (int i = 0; i < (int)s.length() - (int)t.length(); i++) {
      t1 += "0";
    }
    t = t1 + t;
    int len = s.length();
    reverse(s.begin(), s.end());
    reverse(t.begin(), t.end());
    priority_queue<int, vector<int>, cmp> ques, quet, que;
    int ans = 0;
    for (int i = len - 1, j = len - 1; i >= 0 && j >= 0; i--, j--) {
      if (s[i] == t[j]) continue;
      if (s[i] == '0' && t[j] == '1') {
        if (ques.size() && ques.top() > j + 2) {
          ans = 1;
          break;
        }
        int f = 0;
        while (ques.size() && !f) {
          int a = ques.top();
          ques.pop();
          if (a == j) {
            f = 1;
            break;
          }
          if (a - 1 == j)
            f = 1;
          else
            ques.push(a - 1);
          if (a - 2 == j)
            f = 1;
          else
            ques.push(a - 2);
        }
        if (!f) quet.push(j);
      }
      if (s[i] == '1' && t[j] == '0') {
        if (quet.size() && quet.top() > i + 2) {
          ans = -1;
          break;
        }
        int f = 0;
        while (quet.size() && !f) {
          int a = quet.top();
          quet.pop();
          if (a == i) {
            f = 1;
            break;
          }
          if (a - 1 == i)
            f = 1;
          else
            quet.push(a - 1);
          if (a - 2 == i)
            f = 1;
          else
            quet.push(a - 2);
        }
        if (!f) ques.push(i);
      }
    }
    if (ques.size()) ans = 1;
    if (quet.size()) ans = -1;
    if (ans == 0)
      cout << "=\n";
    else if (ans == -1)
      cout << "<\n";
    else
      cout << ">\n";
  }
}
