```python
def sequence(n):
    """
    Calculates the n-th number in the Newman-Conway sequence.
    """
    # Assuming n is a positive integer (n >= 1).
    # The problem asks for the n-th number, which implies a 1-based index.

    # For n=1 or n=2, the loop below will not execute, and the function
    # will correctly return memo[1] or memo[2] from the initial list.
    
    # 'memo' will store the calculated sequence values.
    # We use 1-based indexing for clarity, so memo[0] is a placeholder.
    memo = [0, 1, 1]

    # Build the sequence iteratively from the 3rd term up to the n-th term.
    for i in range(3, n + 1):
        # This is the direct application of the recurrence relation:
        # P(i) = P(P(i-1)) + P(i - P(i-1))
        
        # Value of the previous term, P(i-1)
        p_of_i_minus_1 = memo[i - 1]
        
        # Calculate the new term using values already in our memo list.
        new_term = memo[p_of_i_minus_1] + memo[i - p_of_i_minus_1]
        
        memo.append(new_term)

    # The n-th term is at index n in our 1-indexed list.
    return memo[n]
```