英语翻译Paco loves playing with stacks of blocks.He likes to pre

英语翻译
Paco loves playing with stacks of blocks.He likes to pretend that they are mountains,and he loves making his own terrain.Lately,he’s been restricting himself to a particular way of rearranging the blocks.He puts all of his stacks of blocks into a straight line.Then,he only changes the arrangement one block at a time.Paco does this by finding two adjacent stacks of blocks and moving one block from one stack to the other.
Paco has made all sorts of arrangements of his ‘mountains’ using this technique.Now he has decided to make his most beautiful arrangements yet.Paco finds a mountain range beautiful if,for every pair of mountains,the distance between the two mountains is a prime number (that's every pair,not just every adjacent pair).A mountain range with a single stack is beautiful by default.Paco considers a stack of blocks to be a mountain if it has at least one block.
This diagram shows an initial configuration of the blocks,and a way to make two stacks,at a distance of three apart,with 13 moves.However,with only 6 moves,Paco can make a beautiful arrangement with 3 stacks
Given a current arrangement of blocks,what is the minimum amount of effort needed for Paco to make it beautiful?

帕克喜欢玩堆积木.他喜欢假装他们是山,他喜欢做自己的地形.最近,他被限制自己一种特别的方式重新排列块.他把他所有的一块成一条直线.然后,他只改变安排一次一块.帕克是通过寻找块相邻的两个栈和移动一块从一堆其他.
帕克取得的种种安排他的'山'使用这种技术.现在他已经决定把他最美丽的安排吗.帕克发现山脉美丽的山如果,每一对,两山之间的距离是一个素数（这是每一对,不是每对相邻）.一个单一的堆栈的山脉是美丽的默认.帕克认为一堆块是一个山如果至少有一块.
本图显示模块的初始配置,并让两个栈,在距离三分开,13步.然而,只有6的动作,帕克可以有3层做一个美丽的安排
给定一块目前的安排,对帕克使它美丽需要努力的最低金额是多少?