#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

const int MOD     = 1e9+7;
const int INF     = 0x3f3f3f3f;
const ll  LLINF   = 0x3f3f3f3f3f3f3f3f;
const int MAXN    = 100005;
const int MAXM    = 1000005;

ll a[MAXN], vis[MAXN];

int main(){
    
    ll A, B , C;
    cin >> A >> B >> C;
    int ans = 0;
    if(A<0 && B < 0 || A >= 0 && B >= 0) {
        if(A < B) ans = -1;
        else if(A == B) ans = 0;
        else ans = 1;
    }
    else if(A < 0 && B >= 0) {
        if(C%2 == 1) {
            ans = -1;
        } else {
            if(-1*A < B) ans = -1;
            else if(-1*A == B) ans = 0;
            else if(-1*A > B) ans = 1;
        }
    }
    else if(B<0 && A >= 0) {
        if(C%2 == 1) {
            ans = 1;
        } else {
            if(-1*B < A) ans = 1;
            else if(-1*B == A) ans = 0;
            else if(-1*B > A) ans = -1;
        }
    }
    if(ans == -1) cout << "<" << endl;
    else if(ans == 0) cout << "=" << endl;
    else cout << ">" << endl;
    return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <stdlib.h>
#include <cstring>
#include <cmath>
#include <math.h>
#include <string>
typedef long long ll;
using namespace std;
#define inf 1e9
int a,b,c;
void solve(){
    cin >> a >> b >> c;
    a = 7-a;
    b = 7-b;
    c = 7-c;
    cout <<a+b+c;
}



int main(){
    solve(); 
    return 0;
    
}