[ฟรีซddd]

Each of faces of a regular octahedron is numbered with a different integer. Each vertex is assigned a "vertex number" which is the sum of the numbers on the faces which intersect in that vertex and then the sum of the vertex numbers is calculated. What is the highest number which must divide this sum,for every possible numbering of the faces?
(ฝากแปลโจทย์+วิธีทำด้วยนะครับ)