fn number_line_jumps(x1: i32, v1: i32, x2: i32, v2: i32) -> String {
    //Time complexity: O(1)
    //Space complexity (ignoring input): O(1)
    if x1 == x2 {
        return "YES".to_string();
    }
    if v1 == v2 {
        return "NO".to_string();
    }

    let relative_speed = v2 - v1;
    let initial_distance = x1 - x2;
    let jumps = initial_distance as f32 / relative_speed as f32;
    if jumps == jumps.abs().floor() {
        return "YES".to_string();
    }

    "NO".to_string()
}

def number_line_jumps(x1, v1, x2, v2):
    # Time complexity: O(1)
    # Space complexity (ignoring input): O(1)
    if x1 == x2:
        return "YES"
    if v1 == v2:
        return "NO"

    relative_speed = v2 - v1
    initial_distance = x1 - x2
    jumps = initial_distance / relative_speed

    if jumps == abs(int(jumps)):
        return "YES"

    return "NO"

#python solution
def kangaroo(x1, v1, x2, v2):
    #tests if intersection is not possible
    if (v1 == v2 and x1 != x2) or v2 > v1: 
        return "NO"
        
    k1 = x1
    k2 = x2
		
    #tests if intersection will happen at an integer
    while k1 < k2:
        k1 += v1
        k2 += v2
        if k1 > k2:
            return "NO"
            
    return "YES"