use std::cmp::*;
use input_mcr::*;

use binary_search::*;

fn main() {
    input! {
        n: usize,
        xs: [i64; n],
        ys: [i64; n],
    }
    let mut count = vec![0; 32];
    for i in (0..32).rev() {
        let xs: Vec<_> = xs.iter().map(|&x| x & ((1 << (i+1)) - 1)).collect();
        let mut ys: Vec<_> = ys.iter().map(|&x| x & ((1 << (i+1)) - 1)).collect();
        ys.sort();
        let ys = ys;
        // // eprintln!("i = {}, [{},{})\n", i, 0, 1<<(i+1));
        for &x in &xs {
            for &y in &ys {
                if (x + y) & (1 << i) == 0 {
                    // eprintln!("x = {:3}, y = {:3}, 0", x, y);
                } else {
                    // eprintln!("x = {:3}, y = {:3}, 1", x, y);
                }
            }
            let p0 = 0;
            let p1 = binary_search_on_array_true_false(&ys, |yi| (x + ys[yi]) >> i < 1);
            let p2 = binary_search_on_array_true_false(&ys, |yi| (x + ys[yi]) >> i < 2);
            let p3 = binary_search_on_array_true_false(&ys, |yi| (x + ys[yi]) >> i < 3);
            // eprintln!("p0 = {}, p1 = {}, p2 = {}, p3 = {}", p0, p1, p2, p3);
            count[i] += (n - p3) + (p2 - p1);
        }
    }
    let mut res = 0i64;
    for i in 0..32 {
        if count[i] & 1 != 0 {
            res += 1i64 << i;
        }
    }
    println!("{}", res);
}

/*
8
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
*/
pub mod input_mcr {
    // ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
    #[macro_export(local_inner_macros)]
    macro_rules! input {
        (source = $s:expr, $($r:tt)*) => {
            let mut parser = Parser::from_str($s);
            input_inner!{parser, $($r)*}
        };
        (parser = $parser:ident, $($r:tt)*) => {
            input_inner!{$parser, $($r)*}
        };
        (new_stdin_parser = $parser:ident, $($r:tt)*) => {
            let stdin = std::io::stdin();
            let reader = std::io::BufReader::new(stdin.lock());
            let mut $parser = Parser::new(reader);
            input_inner!{$parser, $($r)*}
        };
        ($($r:tt)*) => {
            input!{new_stdin_parser = parser, $($r)*}
        };
    }
    
    #[macro_export(local_inner_macros)]
    macro_rules! input_inner {
        ($parser:ident) => {};
        ($parser:ident, ) => {};
        ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
            let $var = read_value!($parser, $t);
            input_inner!{$parser $($r)*}
        };
    }
    
    #[macro_export(local_inner_macros)]
    macro_rules! read_value {
        ($parser:ident, ( $($t:tt),* )) => {
            ( $(read_value!($parser, $t)),* )
        };
        ($parser:ident, [ $t:tt ; $len:expr ]) => {
            (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
        };
        ($parser:ident, chars) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()
        };
        ($parser:ident, char_) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()[0]
        };
        ($parser:ident, usize1) => {
            read_value!($parser, usize) - 1
        };
        ($parser:ident, line) => {
            $parser.next_line()
        };
        ($parser:ident, line_) => {
            $parser.next_line().chars().collect::<Vec<char>>()
        };
        ($parser:ident, $t:ty) => {
            $parser.next::<$t>().expect("Parse error")
        };
    }
    
    use std::io;
    use std::io::BufRead;
    use std::str;
    use std::collections::VecDeque;
    
    pub struct Parser<R> {
        pub reader: R,
        buf: VecDeque<u8>,
        parse_buf: Vec<u8>,
    }
    
    impl Parser<io::Empty> {
        pub fn from_str(s: &str) -> Parser<io::Empty> {
            Parser {
                reader: io::empty(),
                buf: VecDeque::from(s.as_bytes().to_vec()),
                parse_buf: vec![],
            }
        }
    }
    
    impl<R: BufRead> Parser<R> {
        pub fn new(reader: R) -> Parser<R> {
            Parser {
                reader: reader,
                buf: VecDeque::new(),
                parse_buf: vec![],
            }
        }
        pub fn update_buf(&mut self) {
            loop {
                let (len, complete) = {
                    let buf2 = self.reader.fill_buf().unwrap();
                    self.buf.extend(buf2.iter());
                    let len = buf2.len();
                    (len, buf2.last() < Some(&0x20))
                };
                self.reader.consume(len);
                if complete {
                    break;
                }
            }
        }
        pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c > 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c <= 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.parse::<T>();
                }
            }
        }
        pub fn next_line(&mut self) -> String {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c >= 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c < 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.to_string();
                }
            }
        }
    }
}
pub mod binary_search {
    /*
              v
      T T T T F F F F
    */
    pub fn binary_search_on_array_true_false<F: Fn(usize) -> bool, T>(xs: &[T], f: F) -> usize {
        let m = 30;
        let mut res = (1 << m) - 1;
        for i in (0..m).rev() {
            let t = res - (1 << i);
            if t < xs.len() {
                if !f(t) {
                    res = t;
                }
            } else {
                res = t;
            }
        }
        res
    }
}



Measured memory_bytes: 12736