How can i solve this basic problem in c++? [closed]

problem:
inter int number for instance n
Find a set of prime numbers whose number is equal 4 and whose
sum is equal to n
for example if you input 45 we have this below sets :
2 3 11 29
2 3 17 23
2 5 7 31
2 7 13 23
2 7 17 19
2 11 13 19
note:we don.t have duplicate sets
our output is : 6

Note : I cant use array and I know just condition and loop and personal functions.