#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn calc(a: i64, b: i64, c: i64, d: i64, x: i64) -> i64 {
    if x == 0 {
        return (a - c).abs() + (b - d).abs();
    }
    if a / x != c / x && b / x != d / x {
        return (a - c).abs() + (b - d).abs();
    }
    if a / x == c / x && b / x == d / x {
        return calc(a % x, b % x, c % x, d % x, x / 3);
    }
    if b / x != d / x {
        return calc(b, a, d, c, x);
    }
    assert_ne!(a / x, c / x);
    assert_eq!(b / x, d / x);
    let (a, b, c, d) = if a < c {
        (a, b, c, d)
    } else {
        (c, d, a, b)
    };
    if b / x == 1 {
        if c / x - a / x >= 2 || c - a >= 2 * x {
            let t = min((b - x + 1) + (d - x + 1),
                        (2 * x - b) + (2 * x - d));
            return c - a + t;
        }
    }
    calc(a, b % x, c, d % x, x / 3)
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        abcd: [(i64, i64, i64, i64)],
    }
    let mut p30: i64 = 1;
    for _ in 0..30 { p30 *= 3; }
    for &(a, b, c, d) in &abcd {
        let a = a - 1;
        let b = b - 1;
        let c = c - 1;
        let d = d - 1;
        puts!("{}\n", calc(a, b, c, d, p30 / 3));
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}


Measured memory_bytes: 8572