"use strict";
    
const main = arg => {
    arg = arg.trim().split("\n");
    
    const N    = ~~arg[0].split(" ")[0];
    const a    = arg[1].split(" ");
    
    const set = new Set(a);
    
    if(set.size === 1) {
        console.log(N / 2);
        return;
    }
    
    const oddMap  = [];
    const evenMap = [];
    let oddSet = new Set();
    let evenSet = new Set();
    
    for(let i in a) {
        if(i % 2 === 0) {
            
            if(oddSet.has(a[i])) {
                let exist = oddMap.filter(n=>n.val===a[i]);
                exist.map(n=>n.cnt++);
            } else {
                oddSet.add(a[i]);
                oddMap.push({val:a[i], cnt: 1});
            }
        } else {
            
            if(evenSet.has(a[i])) {
                let exist = evenMap.filter(n=>n.val===a[i]);
                exist.map(n=>n.cnt++);
            } else {
                evenSet.add(a[i]);
                evenMap.push({val:a[i], cnt: 1});
            }
        }
    }
    
    const oddMin1  = oddMap.sort((a,b)=>b.cnt - a.cnt)[0].cnt;
    let   oddMin2;
    
    if(oddSet.size >= 2) {
        oddMin2  = oddMap.sort((a,b)=>b.cnt - a.cnt)[1].cnt;
    }
    
    const evenMin1 = evenMap.sort((a,b)=>b.cnt - a.cnt)[0].cnt;
    let   evenMin2;
    
    if(evenSet.size >= 2) {
        evenMin2 = evenMap.sort((a,b)=>b.cnt - a.cnt)[1].cnt;
    }
    
    let answer;
    
    if(oddSet.size === 1 && evenSet.size === 1) {
        answer = 0;
    } else {
        answer = N - oddMin1 - evenMin1;
        
        if(oddMin1 === evenMin1) {
            answer = Math.min((N - oddMin1 - evenMin2), (N - oddMin2 - evenMin1));
        }
    }
    
    console.log(answer);
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));
