Imagine you're a master codebreaker or an archaeologist of ancient math puzzles. You've stumbled upon an arithmetic sequence, a harmonious string of numbers where each term follows a fixed step. But something is wrong—one number has been corrupted, disturbing the pattern.

Your mission: identify the intruder and restore the sequence to its original perfection.

Task

Write a function that takes a nearly correct arithmetic sequence with exactly one corrupted value and fixes the sequence by replacing the incorrect number with the correct one.

Rules

1. The sequence contains exactly one incorrect value.
2. The repaired sequence must be a valid arithmetic progression.
3. The input sequence will always have at least one solution.

Edge Cases

• If the sequence has 1, 2, or 3 elements, return it unchanged (since there is no definitive way to detect corruption).