# Summoners Incantation

## Solution

```python
input_text = input()  

nums = list(map(int, input_text.strip("[]").split(",")))

def max_sum_non_adjacent(nums):
    if not nums:
        return 0
    if len(nums) == 1:
        return nums[0]
    

    prev_max = nums[0]
    curr_max = max(nums[0], nums[1])
    
    for i in range(2, len(nums)):
        new_max = max(curr_max, prev_max + nums[i])
        
        prev_max = curr_max
        curr_max = new_max
    
    return curr_max


result = max_sum_non_adjacent(nums)
print(result)
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://digitalgarden.batamladen.com/writeups/ctfs/cyberapocalipse-2025/coding/summoners-incantation.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.