Let φ : C2×C2 → C, φ((x1, x2), (y1, y2)) = (x1 −y1) +(x2 −y2). We say that f : R → C preserves distance d ≥ 0 if for each x, y ∈ R φ(x, y) = d implies φ(f(x), f(y)) = d. We prove that if x, y ∈ R and |x − y| = (2 √ 2/3) · ( √ 3) (k, l are non-negative integers) then there exists a finite set {x, y} ⊆ Sxy ⊆ R such that each unit-distance preserving mapping from Sxy to C 2 preserves the distance ...