#include <iostream>
#include <algorithm>
#include <limits>
#include <vector>
#include <map>
#include <cmath>
#include <limits>
#include <iomanip>
#include <queue>
#include <string.h>
#include <bitset>
#define ll long long int
#define ld long double
#define rep(i,n) for(int i = 0;i < n;i++)
#define rep1(i,n) for(int i = 1;i < n;i++)
#define co(x) cout << x << endl
#define cosp(x) cout << x << " "
#define all(x) x.begin(),x.end()
#define allr(x) x.begin(),x.end(),greater<int>()
#define P pair<ll,ll>
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1ll << 60
#define PI 3.14159265359

using namespace std;

int main(){
	ll n;
	ll s,t;
	cin >> n >> s >> t;
	if(n%12 == 0){
		cout << s << " " << t << endl;
	}
	else if(n%12 == 1){
		cout << s-t << " " << t << endl;
	}
	else if(n%12 == 2){
		cout << s-t << " " << s << endl;
	}
	else if(n%12 == 3){
		cout << -t << " " << s << endl;
	}
	else if(n%12 == 4){
		cout << -t << " " << s-t << endl;
	}
	else if(n%12 == 5){
		cout << -s << " " << s-t << endl;
	}
	else if(n%12 == 6){
		cout << -s << " " << -t << endl;
	}
	else if(n%12 == 7){
		cout << -(s-t) << " " << -t << endl;
	}
	else if(n%12 == 8){
		cout << t-s << " " << -s << endl;
	}
	else if(n%12 == 9){
		cout << t << " " << -s << endl;
	}
	else if(n%12 == 10){
		cout << t << " " << t-s << endl;
	}
	else if(n%12 == 11){
		cout << s << " " << -(s-t) << endl;
	}
	return 0;
}
