#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

typedef long long ll;
int const inf = 1<<29;

ll f[100000];

int main() {

  ll F0, F1, N; cin >> F0 >> F1 >> N;
  int cycle = 0;
  f[0] = F0, f[1] = F1;
  rep(i, inf) {
    f[i+2] = f[i] ^ f[i+1];
    if(f[i+2] == F0) {
      cycle = i + 2;
      break;
    }
  }

  cout << f[N % cycle] << endl;

  return 0;
}