#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
clock_t clk = clock();
int i, j;
void solve(void);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) solve();
  return 0;
}
void solve() {
  string a, b;
  cin >> a >> b;
  string temp1, temp2;
  temp1 = "0000";
  temp2 = "0000";
  temp1 += a;
  temp2 += b;
  for (i = 0; i <= (int)temp1.size() - 1; ++i)
    if (temp1[i] == temp1[i + 1] && temp1[i] == '1') {
      temp1[i - 1] = '1';
      temp1[i] = '0';
      temp1[i + 1] = '0';
      i = max(i - 5, 0);
    }
  for (i = 0; i <= (int)temp2.size() - 1; ++i)
    if (temp2[i] == temp2[i + 1] && temp2[i] == '1') {
      temp2[i - 1] = '1';
      temp2[i] = '0';
      temp2[i + 1] = '0';
      i = max(i - 5, 0);
    }
  for (i = 0; i <= (int)temp1.size() - 1; ++i)
    if (temp1[i] == '1') break;
  temp1.erase(0, i);
  for (i = 0; i <= (int)temp2.size() - 1; ++i)
    if (temp2[i] == '1') break;
  temp2.erase(0, i);
  if ((int)temp1.size() > (int)temp2.size())
    cout << ">";
  else if ((int)temp1.size() < (int)temp2.size())
    cout << "<";
  else {
    for (i = 0; i <= (int)temp1.size() - 1; ++i)
      if (temp1[i] > temp2[i]) {
        cout << ">";
        return;
      } else if (temp1[i] < temp2[i]) {
        cout << "<";
        return;
      } else
        continue;
    cout << "=";
    return;
  }
}
