Since there are five cards, at least two of them must be of the same suit. Of the cards of this suit, let X be the one whose distance to the next card (in cyclic order, mod 13) is least. Let Y be this next card. The distance from X to Y (call it N) can be at most 6. Put Y face down. Put X face up, followed by the other three cards. Order the other three cards (based on their linear bridge-type order) to encode N (this can be done since there are 3! = 6 possible orderings). This allows the assistant to deduce Y.