# Segments

*English translation by SOTA – AI Community of the Russian original. Organisers who would like this translation removed can email sota.ai.community@gmail.com.*

All-Russian School Olympiad in Informatics 2025–2026, Regional Stage, Grades 9–11<br>
“Artificial Intelligence” profile, Tour 1, 17 January 2026<br>
Task G

**Points for the task:** 50<br>
**Answer submission format:** entering the answer<br>
**Number of attempts:** 10<br>
**Submission that counts:** the last one

## Statement

Model training runs of equal duration are scheduled on a shared server. Each run is a time segment. All the endpoints of the segments are distinct. The administrator has configured the queue so that at any moment the server is busy with at most two such runs.

Let $A$ be the number of ways to choose a non-empty set of runs that can be carried out without overlapping in time.

For example:

- if there is one segment on the line, then $A = 1$;
- if there are two intersecting segments, then $A = 2$;
- if there are two non-intersecting segments, then $A = 3$.

Which values from the segment $[1500; 2025]$ can the quantity $A$ take?

## Output format

As your answer, output all suitable values **in ascending order**, separated by spaces.

## Scoring

An exact match of the answer: 50 points.

Test results are **not available** during the tour.