#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

int db[1111][64];

int main(void){
	int i,j,p,q,r;
	ll k;
	for(i=0; i<1000; ++i){
		p = i/100; q = (i%100)/10; r = i%10;
		db[i][0] = q*100+r*10+(p+q+r)%10;
		// std::cout << p << " " << q << " " << r << " " << db[i][0] << std::endl;
		// std::cout << i << " " << db[i][0] << std::endl;
	}
	for(j=0; j<62; ++j){
		for(i=0; i<1000; ++i){
			db[i][j+1] = db[db[i][j]][j];
		}
	}
	std::cin >> p >> q >> r; p %= 10; q %= 10; r %= 10;
	i = p*100+q*10+r;
	// std::cout << i << std::endl;
	std::cin >> k; --k;
	for(j=0; j<62; ++j){
		if(k%2){
			// std::cout << i << " " << j << " " << db[i][j] << std::endl;
			i = db[i][j];
		}
		k /= 2;
	}
	std::cout << (i/100) << std::endl;
	return 0;
}