UVA 10162 - Last Digit

/*
ID: BryatnMark
LANG: JAVA
TASK: AC
 */
import java.util.*;
import java.io.*;
import java.math.*;
import java.util.*;

public class Main {
	public static void main(String args[]) throws Exception {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Task solver = new Task();
		solver.main(in, out);
		out.close();
	}
}

class InputReader {
	BufferedReader reader;
	StringTokenizer tokenizer;

	InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream));
		tokenizer = null;
	}

	String next() {
		if (!hasNext())
			throw new RuntimeException();
		return tokenizer.nextToken();
	}

	boolean hasNext() {
		while (tokenizer == null || !tokenizer.hasMoreTokens())
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (Exception e) {
				return false;
			}
		return true;
	}

	int nextInt() {
		return Integer.parseInt(next());
	}

	long nextLong() {
		return Long.parseLong(next());
	}

	BigInteger nextBigInteger() {
		return new BigInteger(next());
	}
}

class Task {
	int POW(int a, int b) {
		int res = 1;
		while (b > 0) {
			if ((b & 1) > 0)
				res = res * a % 10;
			a = a * a % 10;
			b >>= 1;
		}
		return res;
	}

	int[] r = new int[111];
	BigInteger twenty=BigInteger.valueOf(20);
	BigInteger four = BigInteger.valueOf(4);
	BigInteger n,hunderd = BigInteger.valueOf(100);
	BigInteger ten=BigInteger.valueOf(10);
	void main(InputReader in, PrintWriter out) throws Exception {
		int i,ans,t;
		for(i=1;i<111;++i)
		{
			r[i]=r[i-1]+POW(i,i);
			if(r[i]>=10)
				r[i]-=10;
		}
		//for(i=10;i<=100;i+=10)
		//	out.println(r[i]);
		
		while (in.hasNext()) {
			n = in.nextBigInteger();
			if(n.compareTo(BigInteger.ZERO)==0) break;
			t=n.intValue();
			if(n.compareTo(hunderd)<=0)
			{
				t=n.intValue();
				ans=r[t];
			}
			else
			{
				n=n.subtract(ten);
				int k=n.mod(twenty).intValue();
				n=n.divide(twenty);
				n=n.multiply(four).mod(ten);
				ans=n.intValue();
				ans+=r[10];
				ans%=10;
				for(i=1;i<=k;++i)
				{
					ans=ans+POW(i%10,(i+2)%4+4);
					ans%=10;
				}
			}
			//out.println(r[t]+" "+t);
			out.println(ans);
		}
	}
}