#include <iostream>

 #include <vector>

 #include <algorithm>

 #include <queue>

 #include <stack>

 #include <string>

 #include <fstream>

 #include <map>

 using namespace std;

 int mindis(int arr[], int n, int x, int y) {

     int pre = ;

     while (arr[pre] != x && arr[pre] != y) pre++;

     int i = pre + ;

     int ans = n;

     for (; i < n; i++) {

         if (arr[i] != x && arr[i] != y) continue;

         if (arr[i] != arr[pre]) ans = min(ans, i - pre);

         pre = i;

     }

     return ans;

 }

 int main() {

     int arr[] = {, , , , , , , , , , , };

     cout << mindis(arr, , , ) << endl;

     return ;

 }