According to the following page, a primary key is used for both LIKE and NOT LIKE conditions:
https://clickhouse.com/docs/en/engines/table-engines/mergetree-family/mergetree/#functions-support

As I found, a primary key is not used for NOT LIKE 'prefix%' conditions, engine scans all granules.

**How to reproduce**
ClickHouse Playground:
https://fiddle.clickhouse.com/095384c8-7b7e-45ec-b7e7-42dc8150be89

```
CREATE TABLE data
(str String)
ENGINE=MergeTree
ORDER BY str;

INSERT INTO data (str)
SELECT 'aa' FROM numbers(100000);

INSERT INTO data (str)
SELECT 'ba' FROM numbers(100000);

INSERT INTO data (str)
SELECT 'ca' FROM numbers(100000);

SET send_logs_level='trace';

SELECT count()
FROM data
WHERE str NOT LIKE 'a%';
```

`(SelectExecutor): Selected 3/3 parts by partition key, 3 parts by primary key, 36/36 marks by primary key, 36 marks to read from 3 ranges`

**Additional context**
Primary key is used for LIKE conditions, engine skips granules:
https://fiddle.clickhouse.com/95dd14a6-2e9f-4c45-94cd-169233f2a702

Primary key is used for != conditions, engine skips granules:
https://fiddle.clickhouse.com/e208b937-20c3-4cc0-896b-bfe83b42454a

{
    for (size_t i = 0, size = key_column_names.size(); i < size; ++i)
    {
        const auto & name = key_column_names[i];
        if (!key_columns.contains(name))
            key_columns[name] = i;
    }
    auto filter_node = buildFilterNode(query, additional_filter_asts);
    if (!filter_node)
    {
        rpn.emplace_back(RPNElement::FUNCTION_UNKNOWN);
        return;
    }
    /** When non-strictly monotonic functions are employed in functional index (e.g. ORDER BY toStartOfHour(dateTime)),
      * the use of NOT operator in predicate will result in the indexing algorithm leave out some data.
      * This is caused by rewriting in KeyCondition::tryParseAtomFromAST of relational operators to less strict
      * when parsing the AST into internal RPN representation.
      * To overcome the problem, before parsing the AST we transform it to its semantically equivalent form where all NOT's
      * are pushed down and applied (when possible) to leaf nodes.
      */
    auto inverted_filter_node = cloneASTWithInversionPushDown(filter_node);
    RPNBuilder<RPNElement> builder(
        inverted_filter_node,
        std::move(context),
        std::move(block_with_constants),
        std::move(prepared_sets),
        [&](const RPNBuilderTreeNode & node, RPNElement & out) { return extractAtomFromTree(node, out); });
    rpn = std::move(builder).extractRPN();
}
KeyCondition::KeyCondition(