In the magical realm of Celestia, the Gates of Harmony stand as the guardians of cosmic balance. To unlock these gates and traverse the celestial planes, travelers must possess an ethereal harmony code, meticulously validated through celestial calculations. The validation process unfolds with intricate celestial patterns to ensure only those attuned to the cosmic energies may pass through. The validation mechanism is outlined as follows: Sum the digits at celestial positions from left to right, where celestial positions are those whose indices are divisible by 3. Compute the product of the digits at harmonic positions from left to right, where harmonic positions are those whose indices are Fibonacci numbers. Determine if the absolute difference between the results from step 1 and step 2 is a prime number. If it is, the harmony code is considered valid; otherwise, it is invalid. Example 1: Consider the harmony code 864201379. Step 1. Sum the digits at celestial positions: 8+0+7=15 Step 2. Compute the product of the digits at harmonic positions: 6*4*1=24 Step 3. Determine if the absolute difference between the results from step 1 and step 2 is prime: 115 - 241 = 9 (not prime) Result: The harmony code 864201379 is invalid. Example 2: Now, let's examine the harmony code 135792468. Step 1. Sum the digits at celestial positions: 1+7+8=16 Step 2. Compute the product of the digits at harmonic positions: 3*9*6 = 162 Step 3. Determine if the absolute difference between the results from step 1 and step 2 is prime: 116 - 1621 = 146 (not prime) Result: The harmony code 135792468 is invalid. Your task is to develop a program that validates these celestial harmony codes. The program should prompt the user to input harmony codes one at a time. After each input, it should determine the validity of the harmony code based on the validation steps described above. Valid harmony codes should be stored in one array, and invalid harmony codes should be stored in another. The program should continue accepting harmony codes until the user enters O, at which point it should display the valid and invalid harmony codes arrays and terminate. Please provide the specified program structure and problem scenario, adhering to the given guidelines and examples.