Find values that appear in exactly one of two sets

Summary

Return the unique values that are present in one collection but not both, presented in sorted order.

Problem statement

Write a function values_in_exactly_one(a, b) that accepts two iterables (like lists or tuples). Determine which values appear in exactly one of the two inputs (i.e., the symmetric difference). Return the result as a sorted list of unique values. Sorting ensures predictable output for testing. You may assume elements within each input are of a type that can be compared with each other (e.g., all ints or all strings).

Task

Given two iterables, compute the values that appear in exactly one of them and return a sorted list of those unique values.

Examples

Input format

Two iterables passed as arguments: values_in_exactly_one(a, b).

Output format

Return a sorted list containing values that appear in exactly one of the inputs.

Constraints

- Elements within each input are comparable (so sorted() works). - Inputs may contain duplicates; the result should contain each unique value once. - Do not use any external libraries.

Samples