fn main() { input! { n: usize, a: [usize; n], } unsafe { solve(a); } } const N: usize = 8; fn solve(a: Vec) { let w = 8 * std::mem::size_of::(); let mut buf = vec![[0usize; N]; (1 << 30) / (w * N)]; let mut memo = vec![[0usize; N]; w * N]; for (x, memo) in memo.iter_mut().enumerate() { memo[x / w] |= 1 << (x % w); bitwise_transform(memo, |a, b| *a |= *b); for x in memo.iter_mut() { *x |= (*x & 0xFFFFFFFF00000000) >> 32; *x |= (*x & 0xFFFF0000FFFF0000) >> 16; *x |= (*x & 0xFF00FF00FF00FF00) >> 8; *x |= (*x & 0xF0F0F0F0F0F0F0F0) >> 4; *x |= (*x & 0xCCCCCCCCCCCCCCCC) >> 2; *x |= (*x & 0xAAAAAAAAAAAAAAAA) >> 1; } } for a in a { op(&mut buf[a / (w * N)], &memo[a % (w * N)]); } bitwise_transform(&mut buf, |a, b| op(a, b)); let ans = buf .into_iter() .flatten() .map(|b| b.count_ones()) .sum::(); println!("{}", ans); } const fn op(a: &mut [usize; N], b: &[usize; N]) { let mut i = 0; while i < N { a[i] |= b[i]; i += 1; } } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // ---------- begin bitwise transform ---------- pub fn bitwise_transform(a: &mut [T], mut f: F) where F: FnMut(&mut T, &mut T), { let n = a.len().trailing_zeros() as usize; assert!(a.len() == 1 << n); for i in (0usize..(1 << n)).step_by(2) { let b = (i | (1 << n)).trailing_zeros() as usize; let a = &mut a[i..i + (1 << b)]; for k in (0..b).rev() { let (x, y) = a.split_at_mut(1 << k); for (x, y) in x.iter_mut().zip(y) { f(x, y); } } } } // ---------- end bitwise transform ----------