#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf (int)1e18+7



signed main() {
    ios_base :: sync_with_stdio(false);
    cin.tie(0);
    int a[3];
    for (int i = 0; i < 3; i ++) {
        cin >> a[i];
    }
    sort(a, a + 3);

    if (a[0] == a[1]) cout << a[2] << endl;
    else if (a[1] == a[2]) cout << a[0] << endl;
    else cout << 0 << endl;
    return 0;
}
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <typename T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
    
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }	
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

void solve() {
	int a, b, c;
	cin >> a >> b >> c;
	if (c & 1) {
		if (a < 0 && b < 0) {
			if (a < b) {
				cout << ">\n";
			} else if (a > b) {
				cout << "<\n";
			} else {
				cout << "=\n";
			}
		}
		else if (a < b) {
			cout << "<\n";
		} else if (a > b) {
			cout << ">\n";
		} else {
			cout << "=\n";
		}
	} else {
		a = abs(a);
		b = abs(b);
		if (a < b) {
			cout << "<\n";
		} else if (a > b) {
			cout << ">\n";
		} else {
			cout << "=\n";
		}
	}
}
int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int _ = 1;
	//cin >> _;
	while (_--) {
		solve();
	}
}
