We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.

Now, given an integer n, write a function that returns true when it is a perfect number and false when it is not.

**Example 1:**

[title]:https://leetcode.com/problems/perfect-number/

package Solution

funccheckPerfectNumber(numint)bool {

ifnum==0 {

}

fori:=1;i<=num/2;i++ {

ifnum%i==0 {

}

}

}

package Solution

import (

)

funcTestCheckPerfectNumber(t*testing.T) {

cases:= []struct {

}{

{"Test case 1",28,true},

}

for_,testcase:=rangecases {

t.Run(testcase.name,func(t*testing.T) {

got:=checkPerfectNumber(testcase.input)

if!reflect.DeepEqual(got,testcase.expected) {

t.Fatalf("expected: %v, but got: %v, with input: %v",

testcase.expected,got,testcase.input)

}

})

}

}