#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:268435456")
using namespace std;
template <typename T>
inline T abs(T a) {
  return ((a < 0) ? -a : a);
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sign(T a) {
  return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int dxK[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dyK[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dxKn[] = {-2, -1, 1, 2, 2, 1, -1, -2};
const int dyKn[] = {1, 2, 2, 1, -1, -2, -2, -1};
const int N = int(1e5) + 9;
const int M = int(3e3) + 9;
const int LOGN = 22;
const int SQN = 350;
const int MOD = int(1e9) + 7;
const int INF = 1e9 + 100;
const long long INF64 = 2e18;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-9;
int v[5] = {0, 2, 4, 3, 1};
int a[5], b[5];
void solve() {
  unsigned long long x;
  cin >> x;
  for (int i = 0; i < (int)(5); ++i) a[i] = x % 10, x /= 10;
  reverse(a, a + 5);
  for (int i = 0; i < (int)(5); ++i) b[i] = a[v[i]];
  for (int i = 0; i < (int)(5); ++i) x = x * 10 + b[i];
  long long nx = x;
  x = x * x * x;
  x %= 100000;
  x = x * nx * nx;
  printf("%05d", x % 100000);
}
int main() {
  srand(time(NULL));
  cout << setprecision(10) << fixed;
  cerr << setprecision(10) << fixed;
  ios_base::sync_with_stdio(0);
  solve();
  return 0;
}
