#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  while (b) b ^= a ^= b ^= a %= b;
  return a;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long bigmod(long long n, long long power, long long mod) {
  if (!power) return 1;
  if (power % 2 == 0) {
    long long ret = bigmod(n, power / 2, mod);
    return ((ret % mod) * (ret % mod)) % mod;
  } else
    return ((n % mod) * (bigmod(n, power - 1, mod) % mod)) % mod;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res *= x;
    x *= x;
    y >>= 1;
  }
  return res;
}
int n, m, cnt, c;
string s, k;
bool arr[100001], ar[100001];
void solve(string x, bool ss[]) {
  int n = x.size();
  for (int i = n - 1; i + 1; i--) {
    ss[i] = x[n - i - 1] - '0';
    for (int j = i; ss[j] && ss[j + 1]; j += 2)
      ss[j] = ss[j + 1] = false, ss[j + 2] = true;
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  cin >> s >> k;
  solve(s, arr);
  solve(k, ar);
  for (int i = max(s.size(), k.size()); i + 1; i--) {
    if (arr[i] && !ar[i])
      return cout << ">", 0;
    else if (!arr[i] && ar[i])
      return cout << "<", 0;
  }
  cout << "=";
  return 0;
}
