
    Design a function for an automated grading system that determines the score a student should receive at checkpoint n, where scores follow a pattern where each new score is equal to the sum of the scores at positions P(P(n-1)) and P(n-P(n-1)), and the sequence starts with P(1)=1 and P(2)=1. This scoring pattern helps assess students' understanding of mathematical sequences and their ability to recognize recursive patterns.
    

    
def sequence(n):
    """
    Design a function for an automated grading system that determines the score a student should receive at checkpoint n, where scores follow a pattern where each new score is equal to the sum of the scores at positions P(P(n-1)) and P(n-P(n-1)), and the sequence starts with P(1)=1 and P(2)=1. This scoring pattern helps assess students' understanding of mathematical sequences and their ability to recognize recursive patterns.
    

    """
def sequence(n):
    """
    Design a function for an automated grading system that determines the score a student should receive at checkpoint n, where scores follow a pattern where each new score is equal to the sum of the scores at positions P(P(n-1)) and P(n-P(n-1)), and the sequence starts with P(1)=1 and P(2)=1. This scoring pattern helps assess students' understanding of mathematical sequences and their ability to recognize recursive patterns.
    

    """
    if n == 1 or n == 2:
        return 1
    else:
        return sequence(sequence(n - 1)) + sequence(n - sequence(n - 1))