#include<bits/stdc++.h> using namespace std; int N=100; uint64_t s = N, t = 0; uint64_t next() { s ^= (s << 13); s ^= (s >> 7); s ^= (s << 17); return s; } int main(){ int n;cin>>n; if(n!=5) return 0; N=1500; uint64_t G[1536][1536]={0}; for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (i == j) G[i][j] = 0; else G[i][j] = next() % N + 1; } } for (int k = 1; k <= N; k++) { for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (G[i][j] > G[i][k] + G[k][j]) G[i][j] = G[i][k] + G[k][j]; } } } cout << G[1][N] << endl; }