Possibly quit your job with a polyglot Despite your protest, you have been put to work by your boss on a program that takes a single unsigned integer as input and prints the string &quot;prime&quot; if that integer is prime and &quot;not prime&quot; if it isn't. You may choose which language you do this in, as long as the resulting program is short; your boss very much appreciates a low character count. (He will actually manually count the characters after he prints out the source code.)
So you better get to it, the lowest character count wins.
The fun part
This is just between you and me, but your program should also be valid in another language. In this language though, it should print the string &quot;If the boss finds this, I quit.&quot;. Make sure that your boss does not figure out there is a hidden insult when reading the code over and over as he keeps forgetting if he'd counted to 17 or 18 so far. For that reason you may not use any of the words in &quot;the boss finds this quit&quot; in part of the code nor can you use and anagrams of those 5 words.
Bonus challenge which I have created a bounty for
Write a program that actually looks like it just solves the first question to the untrained eye and doesn't seem to contain unnecessary characters. This includes comments and segments of code that obviously don't contribute anything. Ideally, a layman would believe that your program is actually as short as it can be without being unmanagable. A helpful comment here and there is okay though.
The rules for the bonus challenge are a bit looser, instead of being judged on easily measurable criteria, your program will be judged more on how it comes accross to me (and the voters of course)
I will be the final judge of which entry comes closest to deserving this bounty.
Edit:
After a few minutes of your boss counting, he had one of your colleages write a character counting program for him. So even characters that aren't visible count towards your character count.
Python 2 / Python 3 - 128

n=int(input())
s="Isf  tthhies ,b oIs sq ufiitn.d"
print(["not "*any([n%a&lt;1for a in range(2,n)])+"prime",s[::2]+s[1::2]][1/2&gt;0])


Identifies prime numbers with Python 2, get's you into trouble with Python 3.



Bonus



__help__ = """In the forloop I'm setting the values i to n.
To be a "notPrimes", it's n % i == 0 if: 1 &lt; i, i &lt; n. (We
do tests i&lt;1/2 i==1, too). Then, prints resulting, prime text.
In case i==n: quit. Just if it aborts: try."""

# read integer from command line
n=int(input())

try:

    # primes = True
    notPrimes = False

    # try each i to n
    for i in range(n):

        # ignore 0 or 1
        if i &lt; 1 / 2 or i == 1:
            continue

        # test divisibility
        if n % i == 0:
            notPrimes = True

    # print result
    if notPrimes:
        print("not prime")
    else:
        print("prime")

except:

    # if program aborts: print help and error code
    print(__help__ [::7])


Try it with Python 2 or Python 3! (In contrast to the golf version above the roles changed: Python 3 is the prime number identifier. Python 2 contains the Easter egg.)

Please, excuse my bad English in the help text! ;)

And I do use the word "quit". But somehow I need to describe when my program terminates. ;)