#line 1 "main.cpp"
#include <atcoder/modint>
#include <iostream>

using namespace std;
using lint = long long;
using mint = atcoder::modint1000000007;

void solve() {
    int a, b, c, d;
    lint n;
    cin >> a >> b >> c >> d >> n;

    mint a0, b0;
    if (n % 8 < 4) {
        a0 = b;
    } else {
        a0 = a;
    }
    if (n % 8 < 2 || 6 <= n % 8) {
        b0 = d;
    } else {
        b0 = c;
    }

    a0 *= mint(-4).pow(n / 4);
    b0 *= mint(-4).pow(n / 4);
    n %= 4;

    while (n--) {
        auto a1 = a0 - b0,
             b1 = a0 + b0;
        swap(a0, a1), swap(b0, b1);
    }
    cout << (a0 + b0).val() << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}