#include <bits/stdc++.h>

using namespace std;

int main() {
    int a,b,c;
    cin>>a>>b>>c;
    cout<<(7-a)+(7-b)+(7-c);
    
    
    return 0;
}
//多练，就是多练
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//记得初始化和clear
//记得取模
//数组开够
//边界情况不要想当然
//特判记得return
const int maxn=100010;
const int mod=1e9+7;
int a[1010];
void solve(int T)
{
    ll a,b,c;
    cin>>a>>b>>c;
    if(c%2==0)
    {
        if(c==0)
        {
            cout<<"="<<endl;
            return;
        }
        a=abs(a);b=abs(b);
        if(a>b) cout<<">"<<endl;
        else if(a==b) cout<<"="<<endl;
        else cout<<"<"<<endl;
    }
    else
    {
        if(a<0&&b<0)
        {
            if(a>b) cout<<">"<<endl;
            else if(a==b) cout<<"="<<endl;
            else cout<<"<"<<endl;
        }
        else if(a>=0&&b>=0)
        {
            if(a>b) cout<<">"<<endl;
            else if(a==b) cout<<"="<<endl;
            else cout<<"<"<<endl;
        }
        else if(a>=0&&b<0) cout<<">"<<endl;
        else if(a<0&&b>=0) cout<<"<"<<endl;
    }
    
}
//#define ONLINE_JUDGE
signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("lotato.in","r",stdin);
    freopen("lotato.out","w",stdout);
    #endif
    int t=1;
    //scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        solve(i);
    }
    return 0;
}