The shuffle of a non-empty countable set $ S $ of linear orders is the (unique up to isomorphism) linear order $ Ξ(S) $ obtained by fixing a coloring function $ χ: \mathbb{Q} \to S $ having fibers dense in $ \mathbb{Q} $ and replacing each rational $ q $ in $ (\mathbb{Q}, <) $ with an isomorphic copy of $ χ(q) $. We prove that any two countable shuffles that embed as convex subsets into each other are order isomorphic.