Plus Primes vs Minus Primes Most of us know...
that all primes p&gt;3 are of the form    
But, how many are the Plus Primes (6n+1) and how many are the Minus Primes (6n-1) in a certain range?
The Challenge
Given an integer k&gt;5 , count how many primes&lt;=k are PlusPrimes and how many are MinusPrimes.
Examples
for k=100 we have
[5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89]  12 MinusPrimes
and
[7, 13, 19, 31, 37, 43, 61, 67, 73, 79, 97]      11 PlusPrimes
for k=149 we have
[5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 107, 113, 131, 137, 149]
18 MinusPrimes
and
[7, 13, 19, 31, 37, 43, 61, 67, 73, 79, 97, 103, 109, 127, 139]
15 PlusPrimes
Rules
Your code must output 2 integers: one for the MinusPrimes and one for the PlusPrimes in any order you like (please specify which is which).
This is code-golf: shortest answer in bytes wins!
Test Cases

Input -&gt; Output    [MinusPrimes,PlusPrimes]

6-&gt;[1,0]  
7-&gt;[1,1]   
86-&gt;[11,10]  
986-&gt;[86,78]  
5252-&gt;[351,344]  
100000-&gt;[4806,4784]   
4000000-&gt;[141696, 141448]
05AB1E, 10 9 bytes

Saved 1 byte thanks to Erik the Outgolfer

Outputs as [PlusPrimes, MinusPrimes]  

LDpÏ6%5Ñ¢


Try it online!
or as a Test Suite

Explanation

L             # push range [1 ... input]
 DpÏ          # keep only primes
    6%        # mod each by 6
      5Ñ      # divisors of 5 [1, 5]
        ¢     # count