prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [9, -1, -11, -5, 8, -10, -7, -9, 5, 0]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-1, 6, -10, -9, -1, -1, -11, 2, -6, -3]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [9, -1, -7, -1, -7, -10, -11, -10, -9, 11]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, 5, 10, 11, -5, -7, 8, -9, -11, -5]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, 4, -3, 10, -8, -8, 6, 11, 0, -10]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, -9, -10, -9, 0, -1, 3, 9, -8, 3]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [0, -9, -6, 3, -5, 5, 11, -6, 2, -7]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, -11, -7, -7, -1, -8, 9, -9, -3, 6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-9, -3, 5, 5, -11, -8, -11, -11, 11, 0]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, -6, 6, 0, 10, 11, 6, -4, 2, 6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-10, 4, -3, 9, -11, 7, -11, 0, 0, 10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, -3, -8, -7, 10, 9, -8, 4, -2, -6]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [0, 3, 8, -11, -4, 6, 6, -3, 3, -11]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-4, 8, 9, -11, 9, 7, -4, -4, -4, 8]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-7, 9, -8, 1, -8, -5, 2, 9, -1, 10]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-8, -11, 4, -8, -1, 0, -8, 4, -2, -7]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, 7, 11, -8, -2, 0, -4, -4, 4, -2]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-4, -6, 11, 8, -11, 0, 11, -2, 10, -9]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, 1, 4, 7, -2, 2, 8, -5, -2, 2]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-9, -10, -4, 1, -11, 1, -7, -6, -5, -10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, -10, 1, -6, -9, -4, 0, 4, 0, 1]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [7, -9, 10, -11, -1, -9, 5, 9, -7, 11]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-3, 0, -10, 10, 10, 5, 11, -8, -11, 0]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [3, 7, 2, -6, -7, -6, -2, 8, -3, -9]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, 6, 9, 0, 3, -7, -10, 11, 11, -6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, -11, -5, 6, 1, -2, -7, -7, 4, -4]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-10, -9, -4, 4, 4, 2, -5, -7, -5, 2]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, 3, 6, -10, 8, -8, -8, -6, -3, -9]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-1, 10, -7, -3, 10, 6, 10, -3, 11, -11]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-11, -1, 11, -10, -9, -11, -7, -11, 5, 7]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-5, 1, -8, 0, -3, -2, 3, -10, -8, 2]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [11, 1, -10, 1, -2, -10, -5, 7, -9, -5]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-9, -10, 10, -7, -6, 7, 5, 6, 4, -8]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-1, -5, 9, -5, 11, -8, 11, 4, -3, 0]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-9, 1, -3, -7, 0, 10, 1, 0, -3, 0]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [2, -4, 1, -10, -10, 7, 7, -9, -6, 4]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, 2, 8, -11, 4, 2, 5, 1, -3, -7]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [2, -6, 6, -2, 4, 11, -4, -11, 1, 11]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [10, 10, -5, -11, 0, -8, -10, 1, -7, 10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [10, -11, 4, 6, -6, 9, -1, -3, -4, -10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-10, 3, 5, 11, -8, 0, 5, -9, 4, -2]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [3, -6, -9, 8, -4, 3, -2, -2, -1, -3]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, -1, -8, 11, 4, -6, 8, -6, 8, -5]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, -6, -3, 11, 4, 4, 8, 10, 6, -4]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-4, -10, -11, 5, 1, 9, -5, -8, 11, 9]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-5, -6, 8, 7, 10, 4, 10, -7, 11, 8]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-3, -1, 1, 9, 1, 7, -1, -4, 2, 7]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-4, 3, 10, -3, -9, -6, 9, 10, -11, 6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-3, 8, -7, -1, 5, -6, -11, -4, 5, 9]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, -9, 9, 2, 0, -1, 7, 5, -7, 4]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [11, 0, -11, -5, 9, -3, -11, -6, -7, -9]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [2, 11, 6, -4, 1, -9, 10, 7, -4, -2]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [9, 2, 0, -10, -4, -4, 9, -10, -8, 2]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, 6, -4, 2, 5, -10, 9, 3, 11, 6]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [8, -4, -2, -2, -1, 11, 4, 9, -10, -4]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, 3, 9, 7, -1, -9, -4, 9, 5, 9]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [10, 8, -5, -7, 11, -1, 1, 1, 10, -9]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-7, 3, -2, -4, 8, -1, 0, 1, -10, 4]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [4, 2, -4, -6, 8, 5, 0, -1, 2, -4]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, -8, 7, -7, 11, 9, 0, 2, 7, -5]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [11, 4, -2, -11, 0, -5, -5, -6, -9, 2]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [2, -8, 2, -6, -7, -10, -4, -10, 10, -1]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-4, -3, 3, -3, -5, 1, 7, -1, 10, -4]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, -8, 7, -3, 11, -10, -7, 11, 1, -8]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-10, -3, 6, 9, 9, -1, 4, 9, 4, 11]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-11, -4, 10, 3, -11, 5, -3, 1, 11, 4]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-8, -9, -2, -3, 8, -2, 1, 6, 10, -11]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-3, 2, -1, 1, 7, -9, 6, -4, 5, 11]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, 11, 5, -1, 10, 11, 8, -10, 5, -8]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [10, 0, -5, -10, 2, 10, 4, 2, 4, 0]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-3, -5, 0, 2, -8, -11, -7, -6, 5, 1]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-7, -6, 3, -2, 9, -8, 6, 4, -8, 10]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [0, -10, -3, -9, -10, -11, -1, 9, -8, 10]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, 10, -1, 3, 4, -7, -4, 6, -3, 4]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-4, -10, 2, -5, 8, 7, -5, 5, 2, 9]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-1, 4, 10, -11, -9, -4, 9, -5, -7, -8]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, 10, 6, -6, 1, -9, 2, 0, -4, 5]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [2, -1, -1, -3, -4, 11, -8, -10, 8, 2]

answer: 2


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, -1, 3, 11, 11, -1, -3, -4, -6, -6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, -4, -10, -6, -1, -1, -5, -7, 11, -9]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-5, 6, 10, -4, -10, 7, 9, 7, -9, 0]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [0, -10, -1, -6, 0, -8, 6, 5, 2, -11]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, 2, 0, 1, -5, -2, -6, -8, -3, -4]

answer: 2


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [0, 1, -11, 4, -7, -4, 9, 10, 11, -1]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [3, -6, 5, -3, 4, -11, 9, 7, -9, -10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [8, 8, -11, -6, -3, 6, -6, 5, -1, -8]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, -1, -7, -6, -4, 0, 8, 10, -5, -6]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [0, 9, -8, -1, -5, -1, 0, 2, 0, -6]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-1, -11, 5, -2, 4, 11, -1, 6, 7, -9]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [0, 8, 3, 9, -7, 5, -3, 5, 7, -5]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, 5, 1, -1, -8, 3, 9, -11, -7, -7]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, -4, -1, -7, -11, 10, -8, -11, -11, 2]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [4, 4, -8, 9, -7, 0, -5, 8, -10, -6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [10, 11, -2, -2, 10, 1, 3, 8, 9, 10]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-5, 2, 5, -7, 6, 0, 5, 11, -8, 4]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, 8, -2, 7, 2, -10, 1, 5, 10, -4]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [8, -2, 2, -5, -5, -4, 4, -6, 2, 2]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-3, -1, 7, 11, 8, 10, 9, 6, 0, -5]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-6, 7, -7, -5, 11, 6, 10, 11, -8, 2]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, 8, 9, -9, 5, 1, -6, 2, 9, -1]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-10, 3, 2, 0, 10, -4, 6, -1, -7, -10]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [1, 2, 1, -2, 5, -5, -10, 3, 11, 8]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [11, 3, 5, -8, 0, -5, 11, 4, 7, -4]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-7, -7, -3, -3, -11, -10, 11, 3, -9, 10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [3, 7, -11, 7, -7, -9, -3, -3, -5, 2]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, -10, -6, -7, 8, -3, -2, -8, -9, -1]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, 2, 8, 1, -11, 1, -6, -10, 3, 4]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-5, 1, -1, -1, 7, 0, 1, 8, 11, -7]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, 9, 11, 9, 7, -10, 5, 7, -2, -8]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-4, -8, 10, 7, 5, 1, -9, 10, 7, 10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [10, -2, 10, -8, 1, 9, 3, 10, 7, -10]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-7, 3, -3, 0, 8, -3, 3, 11, 10, 5]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-1, 11, 1, -5, 7, -10, -5, 11, 2, -6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [10, 11, 3, -7, -9, 10, -5, -7, -10, 5]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-7, 8, 2, -6, 0, -9, 5, -10, -3, 1]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-8, 7, -7, 0, 10, 0, 0, 9, -9, -3]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, -7, 3, -7, 1, 1, 4, 7, 8, 10]

answer: 6


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-10, 6, -5, -11, -7, 11, -10, 0, -9, 3]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, 7, 8, -5, 11, 11, 1, 8, -11, -4]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-8, 0, -4, 4, -1, 11, -4, -10, 4, 4]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-2, -5, -9, 4, -9, 8, 0, 0, 8, -10]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [7, 1, 8, 8, 6, 7, 8, 4, 10, 6]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-8, -2, -11, -10, -6, 1, 1, 7, -4, -2]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, 4, -4, 0, 4, 7, -8, 2, 2, 11]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [-7, 0, 11, 8, -6, 2, -4, -5, -11, -6]

answer: 3


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, -11, -5, 2, -6, -3, -11, 5, 9, -8]

answer: 5


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [5, 6, 4, 2, 9, 3, 11, -2, 7, 6]

answer: 4


prompt:
You are given a sequence of integers.

Task: compute the length of the Longest Increasing Subsequence (LIS).

Definitions:
- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.
- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.

Output requirements:
- Return ONLY the LIS length as an integer.

Sequence: [6, -5, 8, 0, 2, -1, 2, 2, 1, -5]

answer: 3