#pragma comment(linker, "/STACK:102400000,102400000") #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <sstream>
#include <iostream>
using namespace std;
#define INF 0x3fffffffint n;
int save[10]={1,1,2,6,4,2,2,4,2,8};
char s[1100];
int d[1100];
int i,ti;
int tmp1;
int cnt;int dfs(int len)
{int tmp=1;for(i=len;i>=0;i--)if(d[i]!=0) break;if(i<0){return 1;}if(i==0){return save[d[0]];}if(d[1]%2==0) tmp=6;else tmp=4;tmp = ( tmp*save[d[0]] )%10;ti=i;for(;i>=0;i--){tmp1=d[i]%5;d[i]/=5;if(i!=0)d[i-1]+=tmp1*10; //将余数向下推
    }return (tmp*dfs(ti))%10;
}int main()
{//freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);//freopen("C:\\Users\\Administrator\\Desktop\\in.txt","w",stdout);while(~scanf("%s",s)){//主要是将所有数2和5因子提取出来就可以了,剩下来的取最后一个数即可//然后就是最后一位怎么看了,int len=strlen(s);memset(d,0,sizeof(d));cnt=0;for(int i=0;i<len;i++)d[len-1-i]=s[i]-'0';printf("%d\n",dfs(len-1));}return 0;
}

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <stdlib.h>
using namespace std;char str[10100];
int num[10100];
int ans[10100];int chg(char c)
{return c-'0';
}int main()
{while( scanf("%s",str) != EOF ){int len=strlen(str);for(int i=0;i<len;i++)num[i] = chg( str[i] );int cnt=0;for(int i=0;i<len;i++)if(num[i]==0) cnt++;else break;int wei=0;int from=10,to=5;while( cnt < len ){//然后做一次除法for(int i=cnt;i<len;i++){num[ i+1 ] += (num[i]%to)*from;num[ i ] /= to;}ans[ wei++ ] = num[len]/from;num[len]=0;for(int i=cnt;i<len;i++){if(num[i]==0) cnt++;else break;}}/*for(int i=wei-1;i>=0;i--){printf("%d",ans[i]);}printf("\n");*/int tmp = 1;int sum = 1;for(int i=0;i<wei;i++){int some=ans[i+1]%2==0?0:5;for(int j=1+some;j<=ans[i]+some;j++){sum = (sum*j*tmp);sum = sum%10;}tmp = tmp*2;tmp = tmp%10;}printf("%d\n",sum);}return 0;
}