/*
Given an integer n, return the number of prime numbers that are strictly less than n.
 
 
 
Example 1:
 
Input: n = 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
Example 2:
 
Input: n = 0
Output: 0
Example 3:
 
Input: n = 1
Output: 0
*/
 
let n = 10
let output = 0
let count = 0
 
for (let i=1; i<=n; i++){
	for(let j=1; j<=i; j++){
		if(i%j === 0) count = count+1
	}
	if(count === 1) output = output +1
	count = 0
}
 
console.log(output)
 
 
 

LyoKR2l2ZW4gYW4gaW50ZWdlciBuLCByZXR1cm4gdGhlIG51bWJlciBvZiBwcmltZSBudW1iZXJzIHRoYXQgYXJlIHN0cmljdGx5IGxlc3MgdGhhbiBuLgoKIAoKRXhhbXBsZSAxOgoKSW5wdXQ6IG4gPSAxMApPdXRwdXQ6IDQKRXhwbGFuYXRpb246IFRoZXJlIGFyZSA0IHByaW1lIG51bWJlcnMgbGVzcyB0aGFuIDEwLCB0aGV5IGFyZSAyLCAzLCA1LCA3LgpFeGFtcGxlIDI6CgpJbnB1dDogbiA9IDAKT3V0cHV0OiAwCkV4YW1wbGUgMzoKCklucHV0OiBuID0gMQpPdXRwdXQ6IDAKKi8KCmxldCBuID0gMTAKbGV0IG91dHB1dCA9IDAKbGV0IGNvdW50ID0gMAoKZm9yIChsZXQgaT0xOyBpPD1uOyBpKyspewoJZm9yKGxldCBqPTE7IGo8PWk7IGorKyl7CgkJaWYoaSVqID09PSAwKSBjb3VudCA9IGNvdW50KzEKCX0KCWlmKGNvdW50ID09PSAxKSBvdXRwdXQgPSBvdXRwdXQgKzEKCWNvdW50ID0gMAp9Cgpjb25zb2xlLmxvZyhvdXRwdXQpCgoK