Given a regular hexagon and a regular octagon, how many ways can you arrange the vertices of both polygons such that no two adjacent vertices of either polygon have the same label? The vertices of each polygon are labeled using distinct numbers from 1 to \( n \), where \( n \) is the number of vertices in the polygon. Let's think step by step and output the final answer within \boxed{}.
user