using System;
using System.Linq;
using System.Collections.Generic;

namespace Contest
{
    class Program
    {
        static void Main(string[] args)
        {
            ABC111.C();
        }
        class ABC111
        {
            public static void A()
            {
                Console.WriteLine(1110 - Read.Int());
            }
            public static void B()
            {
                Console.WriteLine((Read.Int() + 110) / 111 * 111);
            }
            public static void C()
            {
                var N = Read.Int();
                var V = Read.IntN();
                var count0 = new Util.MyDict<int, int>();
                var count1 = new Util.MyDict<int, int>();
                for(int i = 0; i < N; ++i)
                {
                    (i % 2 == 0 ? count0 : count1)[V[i]]++;
                }
                var max0 = count0.OrderBy(x => -x.Value).First();
                var max1 = count1.OrderBy(x => -x.Value).First();
                if (max0.Key != max1.Key)
                {
                    Console.WriteLine(N - max0.Value - max1.Value);return;
                }
                var second0 = count0.Count == 1 ? 0 : count0.OrderBy(x => -x.Value).ElementAt(1).Value;
                var second1 = count1.Count == 1 ? 0 : count1.OrderBy(x => -x.Value).ElementAt(1).Value;
                var min = N - Math.Max(max0.Value + second1, max1.Value + second0);
                Console.WriteLine(min);
            }
            public static void D()
            {

            }
        }

        class Util
        {
            public class MyDict<T1, T2> : Dictionary<T1, T2>
            {
                public new T2 this[T1 key]
                {
                    get { if (!base.ContainsKey(key)) { base.Add(key, default(T2)); } return base[key]; }
                    set { base[key] = value; }
                }
            }
        }

        static class Read
        {
            static Queue<string> queue = new Queue<string>();
            static void Enqueue() { var ss = Console.ReadLine().Split(' '); foreach (var s in ss) { queue.Enqueue(s); } }
            public static int Int() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt32(queue.Dequeue()); }
            public static long Long() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt64(queue.Dequeue()); }
            public static string Str() { if (queue.Count == 0) { Enqueue(); } return queue.Dequeue(); }
            public static int[] IntN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt32(s)).ToArray(); }
            public static long[] LongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt64(s)).ToArray(); }
            public static string[] StrN() { return Console.ReadLine().Split(' '); }
            public static Tuple<int, int>[] TupleInt(int n) { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); for (int i = 0; i < n; ++i) { var ab = Read.IntN(); list.Add(new Tuple<int, int>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<long, long>[] TupleLong(int n) { List<Tuple<long, long>> list = new List<Tuple<long, long>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<long, long>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<string, string>[] TupleStr(int n) { List<Tuple<string, string>> list = new List<Tuple<string, string>>(); for (int i = 0; i < n; ++i) { var ab = Read.StrN(); list.Add(new Tuple<string, string>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<double, double>[] TupleDouble(int n) { List<Tuple<double, double>> list = new List<Tuple<double, double>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<double, double>(ab[0], ab[1])); } return list.ToArray(); }
            public static long[,] LongMatrix(int r, int c)
            {
                var mat = new long[r, c];
                for (int i = 0; i < r; ++i)
                {
                    var x = Read.LongN();
                    for (int j = 0; j < c; ++j)
                    {
                        mat[i, j] = x[j];
                    }
                }
                return mat;
            }
            public static Dictionary<int, HashSet<int>> AdjacencyList(int N, int M)
            {
                Dictionary<int, HashSet<int>> dict = new Dictionary<int, HashSet<int>>();
                for (int i = 0; i <= N; ++i)
                {
                    dict.Add(i, new HashSet<int>());
                }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN();
                    dict[ab[0]].Add(ab[1]);
                    dict[ab[1]].Add(ab[0]);
                }
                return dict;
            }
        }
    }
}


Measured memory_bytes: 26592