Кубик Рубинчика

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define rsor(n) n.rbegin(), n.rend()
#define mp make_pair
#define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
#define p(T) pair<T,T>
#define znac(l) abs(l)/l
const ll ok = ll(1e9 + 7);
int prnt[40256];
short used[40256];
int main()
{
#ifndef ONLINE_JUDGE
    files;
#endif
    ll dl[3][3];
    ll aar[5];
    for (int i = 1; i <= 4; i++)
        aar[i] = 0;
    for(int i=1;i<=2;i++)
        for (int j = 1; j <=4; j++)
        {
            if (j < 3)
            {
                cin >> dl[i][j];
                aar[dl[i][j]]++;
            }
            else
            {
                cin >> aar[0];
            }
        }
    ll pos[20];
    for (int i = 1; i <= 4; i++)
        pos[aar[i]] = i;
    sort(aar + 1, aar + 5);
    ll answ = 0;
    for (int i = 1; i <= 2; i++)
        for (int j = 1; j <= 2; j++)
            if ((pos[aar[4]] == 1 && dl[i][j] == 4) || (pos[aar[4]] == 4 && dl[i][j] == 1))
                answ += 1;
            else
            answ += min(abs(pos[aar[4]] - dl[i][j]), abs(dl[i][j] - pos[aar[4]]));
    cout << answ;
    return 0;
}