#include <bits/stdc++.h>
using namespace std;
template <class T>
string tostring(T x) {
  ostringstream out;
  out << x;
  return out.str();
}
long long toint(string s) {
  istringstream in(s);
  long long x;
  in >> x;
  return x;
}
int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[8] = {1, -1, 0, 0, -1, 1, -1, 1};
int kx[8] = {1, 1, -1, -1, 2, 2, -2, -2};
int ky[8] = {2, -2, 2, -2, 1, -1, 1, -1};
char buf[111111];
string change(string s) {
  if (s[0] == '1') s = "0" + s;
  int i = 1;
  while (i + 1 < s.size()) {
    if (s[i] == '1' && s[i + 1] == '1') {
      s[i - 1] = '1';
      s[i] = '0';
      s[i + 1] = '0';
      i -= 2;
      if (i < 0) i = 0;
    } else {
      i++;
    }
  }
  for (int i = 0; i < s.size(); i++)
    if (s[i] == '1') {
      return s.substr(i);
    }
  return "";
}
string solve(string &s, string &t) {
  if (s == t) return "=";
  if (s.size() > t.size()) return ">";
  if (s.size() < t.size()) return "<";
  for (int i = 0; i < s.size(); i++) {
    if (s[i] > t[i]) return ">";
    if (s[i] < t[i]) return "<";
  }
}
int main() {
  string s, t;
  scanf("%s", buf);
  s = string(buf);
  scanf("%s", buf);
  t = string(buf);
  s = change(s);
  t = change(t);
  cout << solve(s, t) << endl;
  return 0;
}
