Determine whether a given note sequence forms a valid chord type.
Problem
You are given a short sequence of musical notes. Your task is to determine whether the sequence corresponds to a valid chord according to the rule set described in the original problem.
In practice, this kind of task is usually solved by comparing the input notes against a small set of allowed note combinations, often after normalizing the notes to a cyclic order.
Your task
Read the input notes, process them according to the chord rules, and print the required classification or answer.
Notes
- Treat notes as symbols from a finite cyclic scale.
- The solution is expected to be direct and implementation-oriented.
- The exact valid chord condition depends on matching the specified pattern of notes.
Input Format
The input consists of the notes describing the chord, typically as a small fixed-size sequence or a compact string representation.
Output Format
Print the required result for the given chord classification rule. The output is usually a single word or a simple verdict.
Constraints
- The input size is very small.
- A direct or check over the notes is sufficient.
- Use only the provided notes; no large data structures are required.
Example 1
Input
C E G
Output
Major
Explanation
The notes match a standard major triad pattern.
Premium problem context
Unlock deeper context for this problem
Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.