#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
char str1[N];
char str2[N];
int foo[N];
int too[N];
int main() {
  scanf("%s%s", str1, str2);
  int n1 = strlen(str1);
  int n2 = strlen(str2);
  for (int i = n1 - 1; i >= 0; i--) {
    foo[n1 - i - 1] = str1[i] - '0';
  }
  for (int i = n2 - 1; i >= 0; i--) {
    too[n2 - i - 1] = str2[i] - '0';
  }
  for (int i = N - 5; i >= 0; i--) {
    for (int j = i; foo[j] && foo[j + 1]; j += 2) {
      foo[j] = foo[j + 1] = 0;
      foo[j + 2] = 1;
    }
    for (int j = i; too[j] && too[j + 1]; j += 2) {
      too[j] = too[j + 1] = 0;
      too[j + 2] = 1;
    }
  }
  for (int i = N - 5; i >= 0; i--) {
    if (foo[i] > too[i]) {
      puts(">");
      return 0;
    }
    if (foo[i] < too[i]) {
      puts("<");
      return 0;
    }
  }
  puts("=");
  return 0;
}
