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

ActionDAGNodes dag_nodes,
    ContextPtr context,
    const Names & key_column_names,
    const ExpressionActionsPtr & key_expr_,
    NameSet array_joined_column_names_,
    bool single_point_,
    bool strict_)
    : key_expr(key_expr_)
    , key_subexpr_names(getAllSubexpressionNames(*key_expr))
    , array_joined_column_names(std::move(array_joined_column_names_))
    , single_point(single_point_)
    , strict(strict_)
{
    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;
    }
    if (dag_nodes.nodes.empty())
    {
        rpn.emplace_back(RPNElement::FUNCTION_UNKNOWN);
        return;
    }
    auto inverted_dag = cloneASTWithInversionPushDown(std::move(dag_nodes.nodes), context);
    assert(inverted_dag->getOutputs().size() == 1);
    const auto * inverted_dag_filter_node = inverted_dag->getOutputs()[0];
    RPNBuilder<RPNElement> builder(inverted_dag_filter_node, context, [&](const RPNBuilderTreeNode & node, RPNElement & out)
    {
        return extractAtomFromTree(node, out);