package main

import "fmt"

func main() {
	primes := []int{2, 3}

	for i := 3; i < 2_050_000; i++ {
		primeFlag := false
		for _, j := range primes {
			if i%j == 0 {
				primeFlag = true
				break
			}
		}
		if !primeFlag {
			primes = append(primes, i)
		}
	}
	fmt.Println(primes[len(primes)-1])

	ok_primes := []int{}
	// find all the primes that are below 2 mil
	for i := 0; primes[i] < 2_000_000; i++ {
		ok_primes = append(ok_primes, primes[i])
	}
	fmt.Println(ok_primes[len(ok_primes)-1])
	// find the sum
	total := 0
	for _, v := range ok_primes {
		total += v
	}
	fmt.Println(total)
}